* installing to library ‘/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages’
* installing *source* package ‘T4transport’ ...
** this is package ‘T4transport’ version ‘0.1.3’
** package ‘T4transport’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: ‘g++-15 (Debian 15.2.0-7) 15.2.0’
make[1]: Entering directory '/tmp/Rtmp97ocWI/R.INSTALLc642276239a1/T4transport/src'
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c elementary.cpp -o elementary.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c src_dist_ipot.cpp -o src_dist_ipot.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c src_dist_sinkhorn.cpp -o src_dist_sinkhorn.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c src_fixed_bary_benamou.cpp -o src_fixed_bary_benamou.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c src_fixed_bary_sinkhorn.cpp -o src_fixed_bary_sinkhorn.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c src_gaussian.cpp -o src_gaussian.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c src_routines.cpp -o src_routines.o
g++-15 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c utility.cpp -o utility.o
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/scoped_ptr.hpp:13,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:22,
from utility.cpp:4:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include/current/armadillo:38,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo/interface/RcppArmadilloForward.h:57,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo.h:32,
from utility.cpp:3:
/usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/na_assert.hpp:23,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/arg.hpp:25,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/placeholders.hpp:24,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/iterator/iterator_categories.hpp:16,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_traits.hpp:25,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:24:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:598,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:27:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
354 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
365 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
423 | shared_ptr & operator=( std::auto_ptr<Y> & r )
| ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
430 | shared_ptr & operator=( std::auto_ptr<Y> && r )
| ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
432 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
| ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/assert.hpp:35,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:19:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:31,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:20:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/int.hpp:20,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/lambda_fwd.hpp:23,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/na_spec.hpp:18,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/if.hpp:19,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_traits.hpp:17:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
187 | make_iterator_property_map(d_map.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = detail::edge_desc_impl<directed_tag, long unsigned int>; typename std::iterator_traits<_Iterator>::reference = detail::edge_desc_impl<directed_tag, long unsigned int>&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
221 | make_iterator_property_map(pred_vec.begin(), index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = adj_list_dir_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; 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());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = adj_list_dir_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; 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());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:23,
from utility.cpp:5:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; Graph = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | void constraints()
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = adj_list_dir_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; 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());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; Graph = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>]’
245 | return make_iterator_property_map(array_holder.get(), index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>]’
273 | return helper::build(g, index, array_holder);
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
377 | = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>; WeightMap = detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<long int>; Combine = std::plus<long int>; DistInf = long int; DistZero = long int; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_edge_relaxed> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::detail::MapReducedWeight<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>, boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t> >, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_edge_relaxed> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::less<long int>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, detail::MapReducedWeight<filtered_graph<const adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, long int, long int&, long unsigned int, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_residual_capacity_t> >, keep_all>, adj_list_edge_property_map<directed_tag, long int, const long int&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > >, edge_reverse_t> >, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long int, long int&>, std::plus<long int>, std::less<long int> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<const boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long int, long int&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>, edge_desc_impl<boost::directed_tag, long unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename boost::graph_traits<G>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, long unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, long int, const long int&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, long unsigned int>, const edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, const boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, long unsigned int>, boost::property<boost::edge_weight_t, long int> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; typename boost::graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; P = int; T = buffer_param_t; R = no_property; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long int, property<edge_residual_capacity_t, long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int>, property<edge_weight_t, long int> > > > >; typename graph_traits<G>::vertex_descriptor = 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);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R.check/r-devel-gcc/Work/build/lib -Wl,-O1 -o T4transport.so 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 -llapack -L/home/hornik/tmp/R.check/r-devel-gcc/Work/build/lib -lRblas -lgfortran -lm -lquadmath -L/home/hornik/tmp/R.check/r-devel-gcc/Work/build/lib -lR
make[1]: Leaving directory '/tmp/Rtmp97ocWI/R.INSTALLc642276239a1/T4transport/src'
make[1]: Entering directory '/tmp/Rtmp97ocWI/R.INSTALLc642276239a1/T4transport/src'
make[1]: Leaving directory '/tmp/Rtmp97ocWI/R.INSTALLc642276239a1/T4transport/src'
installing to /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/00LOCK-T4transport/00new/T4transport/libs
** 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
** checking absolute paths in shared objects and dynamic libraries
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* DONE (T4transport)