* installing *source* package 'SimilaR' ...
** package 'SimilaR' successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: 'g++.exe (GCC) 13.2.0'
using C++11
make[1]: Entering directory '/d/temp/RtmpKMKvp5/R.INSTALL247904d26662/SimilaR/src'
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c CDG.cpp -o CDG.o
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:22,
                 from common.h:33,
                 from CDG.h:18,
                 from CDG.cpp:18:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
      |                               ^~~~~~~~
In file included from D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/memory:78,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_container.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:20:
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/iterator/iterator_categories.hpp:16,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_traits.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:24:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:27:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  361 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
      |                                                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  508 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  521 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  604 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  613 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  615 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
CDG.cpp: In member function 'void CDGMaker::makeIfNode(SEXP, std::string, const vertex_t&, vertex_t&, std::__cxx11::list<std::pair<long long unsigned int*, long long unsigned int*> >*, bool)':
CDG.cpp:443:10: warning: unused variable 'ifExists' [-Wunused-variable]
  443 |     bool ifExists = true;
      |          ^~~~~~~~
CDG.cpp:545:44: warning: 'if_child' may be used uninitialized [-Wmaybe-uninitialized]
  545 |       branchSizeIf += makeLexicalComparison(if_child, else_child);
      |                       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
CDG.cpp:461:10: note: 'if_child' was declared here
  461 |     SEXP if_child;
      |          ^~~~~~~~
CDG.cpp:545:44: warning: 'else_child' may be used uninitialized [-Wmaybe-uninitialized]
  545 |       branchSizeIf += makeLexicalComparison(if_child, else_child);
      |                       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
CDG.cpp:462:10: note: 'else_child' was declared here
  462 |     SEXP else_child;
      |          ^~~~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:255:
In function 'std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl<G, C, B>&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>; Config = detail::adj_list_gen<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro, listS>::config; Base = bidirectional_graph_helper_with_property<detail::adj_list_gen<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro, listS>::config>]',
    inlined from 'void CDGMaker::makeIfNode(SEXP, std::string, const vertex_t&, vertex_t&, std::__cxx11::list<std::pair<long long unsigned int*, long long unsigned int*> >*, bool)' at CDG.cpp:744:27:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'node' may be used uninitialized [-Wmaybe-uninitialized]
 2271 |     return add_edge(u, v, p, g_);
      |            ~~~~~~~~^~~~~~~~~~~~~
CDG.cpp: In member function 'void CDGMaker::makeIfNode(SEXP, std::string, const vertex_t&, vertex_t&, std::__cxx11::list<std::pair<long long unsigned int*, long long unsigned int*> >*, bool)':
CDG.cpp:439:14: note: 'node' was declared here
  439 |     vertex_t node;
      |              ^~~~
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c DDG.cpp -o DDG.o
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:22,
                 from common.h:33,
                 from DDG.cpp:18:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
      |                               ^~~~~~~~
In file included from D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/memory:78,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_container.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:20:
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/iterator/iterator_categories.hpp:16,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_traits.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:24:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:27:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  361 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
      |                                                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  508 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  521 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  604 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  613 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  615 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/int.hpp:20,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/if.hpp:19,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_traits.hpp:17:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<DDGMaker::ddg_visitor, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/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 D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/copy.hpp:49,
                 from common.h:34:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = DDGMaker::ddg_visitor; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
   37 |     void constraints()
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<DDGMaker::ddg_visitor> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<DDGMaker::ddg_visitor>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<DDGMaker::ddg_visitor>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<DDGMaker::ddg_visitor>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<DDGMaker::ddg_visitor> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<DDGMaker::ddg_visitor> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<DDGMaker::ddg_visitor>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<DDGMaker::ddg_visitor>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = DDGMaker::ddg_visitor; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<DDGMaker::ddg_visitor, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<DDGMaker::ddg_visitor, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<DDGMaker::ddg_visitor, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept<DDGMaker::ddg_visitor>::~CopyConstructibleConcept()'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro 'BOOST_concept'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/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(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<DDGMaker::ddg_visitor>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<DDGMaker::ddg_visitor> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<DDGMaker::ddg_visitor>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<DDGMaker::ddg_visitor>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<DDGMaker::ddg_visitor>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<DDGMaker::ddg_visitor> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = DDGMaker::ddg_visitor]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; Key = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >, long long unsigned int>)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/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(
      |                                                  ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long long unsigned int>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long long unsigned int]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; SourceIterator = long long unsigned int*]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > > >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long long int>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger<long long int>::~SignedInteger()'
  109 |   template <> struct SignedInteger< ::boost::long_long_type> {};
      |                      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:515:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<edge_predicate_c, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>*, std::vector<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge>, std::allocator<boost::detail::stored_edge_iter<long long unsigned int, std::_List_iterator<boost::list_edge<long long unsigned int, Edge> >, Edge> > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long long unsigned int>, long long int> > >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from 'void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; SourceIterator = long long unsigned int*; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; Buffer = queue<long long unsigned int, std::deque<long long unsigned int, std::allocator<long long unsigned int> > >; BFSVisitor = DDGMaker::ddg_visitor; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from 'void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<Vertex, long long unsigned int> >; BFSVisitor = DDGMaker::ddg_visitor; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int; mpl_::false_ = mpl_::bool_<false>]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from 'static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from 'void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, bidirectionalS, Vertex, Edge, GraphPro>, edge_predicate_c>; P = DDGMaker::ddg_visitor; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
DDG.cpp:37:29:   required from here
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c PDG.cpp -o PDG.o
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:22,
                 from common.h:33,
                 from PDG.h:18,
                 from PDG.cpp:18:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
      |                               ^~~~~~~~
In file included from D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/memory:78,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_container.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:20:
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/iterator/iterator_categories.hpp:16,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_traits.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:24:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:27:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  361 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
      |                                                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  508 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  521 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  604 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  613 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  615 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c RcppExports.cpp -o RcppExports.o
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c compare-gplag.cpp -o compare-gplag.o
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:22,
                 from common.h:33,
                 from compare-gplag.cpp:18:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
      |                               ^~~~~~~~
In file included from D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/memory:78,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_container.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:20:
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/iterator/iterator_categories.hpp:16,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_traits.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:24:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:27:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  361 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
      |                                                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  508 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  521 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  604 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  613 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  615 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c generateDataFrame.cpp -o generateDataFrame.o
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c pdgmykernelcomparator.cpp -o pdgmykernelcomparator.o
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:22,
                 from common.h:33,
                 from pdgcomparator.h:19,
                 from pdgkernelcomparator.h:19,
                 from pdgmykernelcomparator.h:18,
                 from pdgmykernelcomparator.cpp:18:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
      |                               ^~~~~~~~
In file included from D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/memory:78,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_container.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:20:
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/iterator/iterator_categories.hpp:16,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_traits.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:24:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:27:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  361 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
      |                                                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  508 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  521 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  604 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  613 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  615 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++  -std=gnu++11 -I"D:/RCompile/recent/R-4.4.0/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/BH/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"     -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c postprocessingPDG.cpp -o postprocessingPDG.o
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:22,
                 from common.h:33,
                 from postprocessingPDG.h:19,
                 from postprocessingPDG.cpp:18:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
      |                               ^~~~~~~~
In file included from D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/memory:78,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_container.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/unordered_set.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:20:
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/arg.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/placeholders.hpp:24,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/iterator/iterator_categories.hpp:16,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/graph_traits.hpp:25,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:24:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/property_map/property_map.hpp:598,
                 from D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/graph/adjacency_list.hpp:27:
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  361 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
      |                                                                 ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  508 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  521 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  604 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  613 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
D:/RCompile/CRANpkg/lib/4.4/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  615 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools44/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/13.2.0/include/c++/bits/unique_ptr.h:65:28: note: declared here
   65 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++ -shared -s -static-libgcc -o SimilaR.dll tmp.def CDG.o DDG.o PDG.o RcppExports.o compare-gplag.o generateDataFrame.o pdgmykernelcomparator.o postprocessingPDG.o -Ld:/rtools44/x86_64-w64-mingw32.static.posix/lib/x64 -Ld:/rtools44/x86_64-w64-mingw32.static.posix/lib -LD:/RCompile/recent/R-4.4.0/bin/x64 -lR
make[1]: Leaving directory '/d/temp/RtmpKMKvp5/R.INSTALL247904d26662/SimilaR/src'
make[1]: Entering directory '/d/temp/RtmpKMKvp5/R.INSTALL247904d26662/SimilaR/src'
make[1]: Leaving directory '/d/temp/RtmpKMKvp5/R.INSTALL247904d26662/SimilaR/src'
installing to d:/Rcompile/CRANpkg/lib/4.4/00LOCK-SimilaR/00new/SimilaR/libs/x64
** R
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
** building package indices
** 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
* MD5 sums
packaged installation of 'SimilaR' as SimilaR_1.0.8.zip
* DONE (SimilaR)