* installing *source* package 'T4transport' ... ** this is package 'T4transport' version '0.1.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c elementary.cpp -o elementary.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c src_dist_ipot.cpp -o src_dist_ipot.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c src_dist_sinkhorn.cpp -o src_dist_sinkhorn.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c src_fixed_bary_benamou.cpp -o src_fixed_bary_benamou.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c src_fixed_bary_sinkhorn.cpp -o src_fixed_bary_sinkhorn.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c src_gaussian.cpp -o src_gaussian.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c src_routines.cpp -o src_routines.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/RcppArmadillo/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -fopenmp -pedantic -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c utility.cpp -o utility.o 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/graph/adjacency_list.hpp:22, from utility.cpp:4: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ 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/RcppArmadillo/include/armadillo:38, from D:/RCompile/CRANpkg/lib/4.6/RcppArmadillo/include/RcppArmadillo/interface/RcppArmadilloForward.h:58, from D:/RCompile/CRANpkg/lib/4.6/RcppArmadillo/include/RcppArmadillo.h:29, from utility.cpp:3: 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 class auto_ptr; | ^~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_traits.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/adjacency_list.hpp:24: 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::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::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_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::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, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/adjacency_list.hpp:27: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ 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 class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & 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 class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && 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 class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & 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 class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && 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 class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( 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 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 597 | BOOST_concept(RandomAccessIterator,(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/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 597 | BOOST_concept(RandomAccessIterator,(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/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_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*, std::vector, std::allocator > > > > >::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*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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/mpl/aux_/integral_wrapper.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/int.hpp:20, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/lambda_fwd.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_spec.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/if.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_traits.hpp:17: 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*, std::vector, std::allocator > > > >::~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::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 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::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 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::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 597 | BOOST_concept(RandomAccessIterator,(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/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 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::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 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::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 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::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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*, std::vector, std::allocator > > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 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::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 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::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 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 > > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]' 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::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 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 > > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]' 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::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 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 > > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]' 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::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]' 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::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]' 32 | inline yes has_constraints_(Model*, wrap_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 > > > >::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/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]' 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::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]' 32 | inline yes has_constraints_(Model*, wrap_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 > > > >::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/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]' 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::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]' 32 | inline yes has_constraints_(Model*, wrap_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 > > > >::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/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]' 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::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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 > > >::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant 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/concept_check.hpp:597:3: required from 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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 >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:603:11: required from 'boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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 >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 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 > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]' 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::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 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 > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]' 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::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 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 > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]' 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::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 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 > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 > > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]' 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::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 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 > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]' 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::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 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 > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >' 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 > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]' 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::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 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 > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]' 32 | inline yes has_constraints_(Model*, wrap_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 > > > >::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/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long int; typename std::iterator_traits< >::reference = long int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:187:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]' 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::failed() [with Model = boost::SignedInteger]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:514:9: required from 'boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: required from 'boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:545:11: required from 'boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:573:11: required from 'boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 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*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 597 | BOOST_concept(RandomAccessIterator,(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/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant 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/concept_check.hpp:597:3: required from 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 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 >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant 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/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant 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/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant 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/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = detail::edge_desc_impl; typename std::iterator_traits< >::reference = detail::edge_desc_impl&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:221:39: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::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 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:87:5: required from 'struct boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >' 45 | typedef boost::integral_constant 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/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 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::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]' 417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight, | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 418 | index_map, compare, combine, inf, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int]' 491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight, | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 492 | index_map, compare, combine, inf, zero, vis, no_named_parameters()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~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::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]' 417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight, | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 418 | index_map, compare, combine, inf, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int]' 491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight, | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 492 | index_map, compare, combine, inf, zero, vis, no_named_parameters()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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/dijkstra_shortest_paths.hpp:21, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:23, from utility.cpp:5: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function 'void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; Graph = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 37 | void constraints() | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]' 417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight, | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 418 | index_map, compare, combine, inf, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int]' 491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight, | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 492 | index_map, compare, combine, inf, zero, vis, no_named_parameters()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 205 | void constraints() { | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]' 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Graph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 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::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]' 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::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 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 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::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >]' 32 | inline yes has_constraints_(Model*, wrap_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*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > > >::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*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >]' 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::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from 'void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; Graph = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 32 | inline yes has_constraints_(Model*, wrap_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*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::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*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >::~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::failed() [with Model = boost::ReadablePropertyMapConcept >, 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::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_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 >, 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 >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::constraints() [with PMap = boost::two_bit_color_map >; 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::failed() [with Model = boost::WritablePropertyMapConcept >, 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::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_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 >, 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 >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::constraints() [with PMap = boost::two_bit_color_map >; 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::ConvertibleConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:208:7: required from 'void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_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 >, 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 >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Assignable]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::EqualityComparable]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::InputIterator]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::ForwardIterator]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::BidirectionalIterator]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Comparable]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::RandomAccessIterator]' 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::failed() [with Model = boost::RandomAccessIteratorConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long long unsigned int*; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long long unsigned int; typename std::iterator_traits< >::reference = long long unsigned int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from 'static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; IndexMap = boost::vec_adj_list_vertex_id_map; Value = long long unsigned int; type = boost::iterator_property_map, long long unsigned int, long long unsigned int&>]' 245 | return make_iterator_property_map(array_holder.get(), index); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from 'static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; IndexMap = boost::vec_adj_list_vertex_id_map; Value = long long unsigned int; type = boost::iterator_property_map, long long unsigned int, long long unsigned int&>]' 273 | return helper::build(g, index, array_holder); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 377 | = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]' 32 | inline yes has_constraints_(Model*, wrap_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 > >::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 > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::DefaultConstructible >]' 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::failed() [with Model = boost::DefaultConstructible >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:90:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]' 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::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]' 32 | inline yes has_constraints_(Model*, wrap_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 > >::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 > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::EqualityComparable >]' 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::failed() [with Model = boost::EqualityComparable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:91:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]' 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::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]' 32 | inline yes has_constraints_(Model*, wrap_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 > >::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 > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Assignable >]' 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::failed() [with Model = boost::Assignable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:92:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Assignable() [with TT = boost::detail::edge_desc_impl]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:93:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistZero = long int; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>; WeightMap = detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = std::plus; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > > >]' 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*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > >]' 32 | inline yes has_constraints_(Model*, wrap_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*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less > > >::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 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, boost::detail::MapReducedWeight, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::ConvertibleConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:148:7: required from 'void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_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 >, 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 >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible]' 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::failed() [with Model = boost::ConvertibleConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:180:7: required from 'void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_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 >, 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 >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Convertible() [with X = boost::read_write_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/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::EqualityComparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::InputIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~InputIterator() [with TT = long long unsigned 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::~usage_requirements() [with Model = boost::ForwardIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~ForwardIterator() [with TT = long long unsigned int*]' 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::~usage_requirements() [with Model = boost::BidirectionalIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~BidirectionalIterator() [with TT = long long unsigned int*]' 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::~usage_requirements() [with Model = boost::Comparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Comparable() [with TT = long long unsigned int*]' 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::~usage_requirements() [with Model = boost::RandomAccessIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~RandomAccessIterator() [with TT = long long unsigned int*]' 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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::DefaultConstructible]' 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::failed() [with Model = boost::DefaultConstructible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:68:9: required from 'boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]' 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::EqualityComparable]' 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::failed() [with Model = boost::EqualityComparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:69:9: required from 'boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]' 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Assignable]' 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::failed() [with Model = boost::Assignable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:70:9: required from 'boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]' 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::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::~usage_requirements() [with Model = boost::DefaultConstructible >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 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 >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]' 32 | inline yes has_constraints_(Model*, wrap_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 > >::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 > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]' 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::~usage_requirements() [with Model = boost::EqualityComparable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 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 >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]' 32 | inline yes has_constraints_(Model*, wrap_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 > >::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 > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]' 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::~usage_requirements() [with Model = boost::Assignable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 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 >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]' 32 | inline yes has_constraints_(Model*, wrap_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 > >::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 > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Assignable() [with TT = boost::detail::edge_desc_impl]' 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::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Convertible() [with X = boost::read_write_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::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Convertible() [with X = boost::read_write_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::~usage_requirements() [with Model = boost::DefaultConstructible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::EqualityComparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::~usage_requirements() [with Model = boost::Assignable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 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' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]' 32 | inline yes has_constraints_(Model*, wrap_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 >::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 >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Assignable, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::EqualityComparable, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:53:35: required from 'boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_edge_relaxed> >, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::less, std::vector > >, detail::MapReducedWeight, property > > > >, is_residual_edge, property > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map, property > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, adj_list_edge_property_map, const detail::edge_desc_impl&, long long unsigned int, const property, property > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long int, long int&>, std::plus, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~InputIterator() [with TT = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::~usage_requirements() [with Model = boost::Assignable, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Assignable() [with TT = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::~usage_requirements() [with Model = boost::EqualityComparable, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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 boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~EqualityComparable() [with TT = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::~usage_requirements() [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 32 | inline yes has_constraints_(Model*, wrap_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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~InputIterator() [with TT = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible, std::input_iterator_tag>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]' 32 | inline yes has_constraints_(Model*, wrap_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, 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, std::input_iterator_tag> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, std::input_iterator_tag>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~usage_requirements() [with Model = boost::Convertible, 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::failed() [with Model = boost::Convertible, std::input_iterator_tag>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: required from 'boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator, boost::property > > > >*, std::vector, boost::property > > > >, std::allocator, boost::property > > > > > > >, long long unsigned int, boost::detail::edge_desc_impl, 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::~IncidenceGraph() [with G = boost::filtered_graph, boost::property > > > >, boost::is_residual_edge, boost::property > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; 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::~usage_requirements() [with Model = boost::Convertible, 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::failed() [with Model = boost::concepts::usage_requirements, 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::input_iterator_tag>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]' 32 | inline yes has_constraints_(Model*, wrap_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, 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, std::input_iterator_tag> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property > > > >; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ 151 | residual_capacity, weight, rev, index, pred, dist, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 152 | make_iterator_property_map(d_map.begin(), index)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, edge_desc_impl, edge_desc_impl&>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 185 | successive_shortest_path_nonnegative_weights_dispatch3(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 186 | capacity, residual_capacity, weight, rev, index, pred, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 187 | make_iterator_property_map(d_map.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 188 | get_param(params, vertex_distance2)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63: required from 'void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map, boost::property > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map, const edge_desc_impl&, long long unsigned int, const boost::property, boost::property > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 219 | successive_shortest_path_nonnegative_weights_dispatch2(g, s, t, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ 220 | capacity, residual_capacity, weight, rev, index, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 221 | make_iterator_property_map(pred_vec.begin(), index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 222 | get_param(params, vertex_distance), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list, property > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits::vertex_descriptor = long long unsigned int]' 234 | return detail::successive_shortest_path_nonnegative_weights_dispatch1(g, s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ 235 | t, | ~~ 236 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 237 | choose_pmap(get_param(params, edge_residual_capacity), g, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 238 | edge_residual_capacity), | ~~~~~~~~~~~~~~~~~~~~~~~~ 239 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 240 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 241 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 242 | get_param(params, vertex_predecessor), params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49: required from 'void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list, property > > > >; typename graph_traits::vertex_descriptor = long long unsigned int]' 251 | successive_shortest_path_nonnegative_weights(g, s, t, params); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ utility.cpp:172:54: required from here 172 | boost::successive_shortest_path_nonnegative_weights(g, src, sink); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 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::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; 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 T4transport.dll tmp.def RcppExports.o elementary.o src_dist_ipot.o src_dist_sinkhorn.o src_fixed_bary_benamou.o src_fixed_bary_sinkhorn.o src_gaussian.o src_routines.o utility.o -fopenmp -LD:/RCompile/recent/R/bin/x64 -lRlapack -LD:/RCompile/recent/R/bin/x64 -lRblas -lgfortran -lquadmath -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-T4transport/00new/T4transport/libs/x64 ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** 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 (T4transport)