* installing *source* package 'starvz' ...
** this is package 'starvz' version '0.8.3'
** using staged installation
** libs
using C++ compiler: 'g++.exe (GCC) 14.2.0'
g++ -std=gnu++17  -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"      -pedantic -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c RcppExports.cpp -o RcppExports.o
g++ -std=gnu++17  -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"      -pedantic -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c integrate_step.cpp -o integrate_step.o
g++ -std=gnu++17  -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"      -pedantic -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c last.cpp -o last.o
g++ -std=gnu++17  -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"      -pedantic -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c separate_res.cpp -o separate_res.o
g++ -std=gnu++17  -I"D:/RCompile/recent/R/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include'   -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include"      -pedantic -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign    -c shortest_path.cpp -o shortest_path.o
In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:22,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/topological_sort.hpp:15,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:13,
                 from shortest_path.cpp:4:
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/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.6/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.6/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:598:
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/scoped_ptr.hpp:13,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr.hpp:17,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:26,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:14:
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/assert.hpp:35,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:19:
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/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.6/BH/include/boost/concept_check.hpp:31,
                 from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:20:
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/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.6/BH/include/boost/concept/detail/general.hpp:8:
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5:   required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/BH/include/boost/concept_check.hpp:514:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:545:11:   required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7:   required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:573:11:   required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7:   required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:603:11:   required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]'
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >::~IncidenceGraphConcept()'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/topological_sort.hpp:16:
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function 'void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   39 |     void constraints()
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
  205 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function 'boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro 'BOOST_concept'
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >'
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5:   required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:116:43:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from 'void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >::~CopyConstructibleConcept()'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:206:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
  147 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:207:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
  179 |     void constraints() {
      |          ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:208:7:   required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5:   required from 'struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:3:   required from 'struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >'
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > > > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:148:7:   required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:180:7:   required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>, long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/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.6/BH/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.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/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.6/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/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.6/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.6/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/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.6/BH/include/boost/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.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/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.6/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.6/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/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.6/BH/include/boost/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.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long long unsigned int>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/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.6/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.6/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3:   required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/BH/include/boost/concept/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> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5:   required from 'struct boost::DefaultConstructible<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/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.6/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.6/BH/include/boost/concept/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> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/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.6/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.6/BH/include/boost/concept/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> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<long long unsigned int>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required 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>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Assignable<long long unsigned int> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/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.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> > >]'
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5:   required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7:   required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> > >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8:   required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>'
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9:   required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int>]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_property<long long unsigned int, boost::property<boost::edge_weight_t, double> > > > >, long long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long long unsigned int>, long long int> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >]'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]':
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47:   required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]'
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5:   required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>'
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]'
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value'
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >'
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from 'void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from 'void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from 'void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, int>, boost::property<boost::edge_weight_t, double> >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>; Params = boost::bgl_named_params<boost::iterator_property_map<long long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params<boost::iterator_property_map<double*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, int>, long long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from 'void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_name_t, int>, property<edge_weight_t, double> >; Param = iterator_property_map<long long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, long long unsigned int, long long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params<iterator_property_map<double*, vec_adj_list_vertex_id_map<property<vertex_name_t, int>, long long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long long unsigned int]'
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortest_path.cpp:70:28:   required from here
   70 |   boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap));
      |   ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
D:/RCompile/CRANpkg/lib/4.6/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.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]'
   37 |       ~model()
      |       ^
D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -shared -s -static-libgcc -o starvz.dll tmp.def RcppExports.o integrate_step.o last.o separate_res.o shortest_path.o -Ld:/rtools45/x86_64-w64-mingw32.static.posix/lib/x64 -Ld:/rtools45/x86_64-w64-mingw32.static.posix/lib -LD:/RCompile/recent/R/bin/x64 -lR
installing to d:/RCompile/CRANincoming/R-devel/lib/00LOCK-starvz/00new/starvz/libs/x64
** R
** data
*** moving datasets to lazyload DB
** 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
* DONE (starvz)