Author
anonymous
over 6 years ago
Language
C++
Compiler
gcc HEAD 9.0.0 20190103 (experimental)
Options
Warnings
Boost 1.69.0
C++2a(GNU)
no pedantic
Author
anonymous
over 6 years ago
$ g++ prog.cc -Wall -Wextra -I/opt/wandbox/boost-1.69.0/gcc-head/include -std=gnu++2a prog.cc: In function 'int main()':
prog.cc:65:15: warning: unused variable 'target' [-Wunused-variable]
65 | const int target = 1;
| ^~~~~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/tuple/tuple.hpp:28,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/graph_traits.hpp:16,
from prog.cc:12:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/tuple/detail/tuple_basic.hpp: In instantiation of 'boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>& boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::operator=(const std::pair<_U1, _U2>&) [with U1 = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >; U2 = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >; T0 = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >&; T1 = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >&; T2 = boost::tuples::null_type; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]':
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:110:31: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:179:16: required from 'bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:198:11: required from 'bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:213:7: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
prog.cc:81:5: required from here
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/tuple/detail/tuple_basic.hpp:587:16: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >& boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >::operator=(const boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >&)' is deprecated [-Wdeprecated-copy]
587 | this->head = k.first;
| ~~~~~~~~~~~^~~~~~~~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adjacency_list.hpp:34,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/adjacency_list.hpp:223,
from prog.cc:13:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adj_list_edge_iterator.hpp:46:14: note: because 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >' has user-provided 'boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::adj_list_edge_iterator(const self&) [with VertexIterator = boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >; OutEdgeIterator = boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>; Graph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::self = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]'
46 | inline adj_list_edge_iterator(const self& x)
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/tuple/tuple.hpp:28,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/graph_traits.hpp:16,
from prog.cc:12:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/tuple/detail/tuple_basic.hpp:588:21: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >& boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >::operator=(const boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >&)' is deprecated [-Wdeprecated-copy]
588 | this->tail.head = k.second;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adjacency_list.hpp:34,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/adjacency_list.hpp:223,
from prog.cc:13:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adj_list_edge_iterator.hpp:46:14: note: because 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >' has user-provided 'boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::adj_list_edge_iterator(const self&) [with VertexIterator = boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >; OutEdgeIterator = boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>; Graph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::self = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]'
46 | inline adj_list_edge_iterator(const self& x)
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/adjacency_list.hpp:28,
from prog.cc:13:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/property_map/property_map.hpp: In instantiation of 'void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; Reference = int&; K = void*; V = void*]':
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/relax.hpp:63:14: required from 'bool boost::relax(typename boost::graph_traits<Graph>::edge_descriptor, const Graph&, const WeightMap&, PredecessorMap&, DistanceMap&, const BinaryFunction&, const BinaryPredicate&) [with Graph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; typename boost::graph_traits<Graph>::edge_descriptor = boost::detail::edge_desc_impl<boost::directed_tag, void*>]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:112:18: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:179:16: required from 'bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:198:11: required from 'bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:213:7: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
prog.cc:81:5: required from here
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/property_map/property_map.hpp:311:44: error: invalid conversion from 'void*' to 'int' [-fpermissive]
311 | static_cast<const PropertyMap&>(pa)[k] = v;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
| |
| void*
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/property_map/property_map.hpp:20,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/adjacency_list.hpp:28,
from prog.cc:13:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp: In instantiation of 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]':
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept/usage.hpp:16:29: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept/detail/general.hpp:39:28: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > > >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > >'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > >'
/opt/wandbox/boost-1.69.0/gcc-head/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*, boost::concepts::detail::wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/graph_concepts.hpp:223:5: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:99:5: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:179:16: required from 'bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:198:11: required from 'bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:213:7: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
prog.cc:81:5: required from here
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp:147:9: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >& boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >::operator=(const boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >&)' is deprecated [-Wdeprecated-copy]
147 | a = b; // require assignment operator
| ~~^~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adjacency_list.hpp:34,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/adjacency_list.hpp:223,
from prog.cc:13:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adj_list_edge_iterator.hpp:46:14: note: because 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >' has user-provided 'boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::adj_list_edge_iterator(const self&) [with VertexIterator = boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >; OutEdgeIterator = boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>; Graph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::self = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]'
46 | inline adj_list_edge_iterator(const self& x)
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/property_map/property_map.hpp:20,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/adjacency_list.hpp:28,
from prog.cc:13:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp: In instantiation of 'void boost::Assignable<TT>::const_constraints(const TT&) [with TT = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]':
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp:149:7: required from 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept/usage.hpp:16:29: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept/detail/general.hpp:39:28: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > > >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > >'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> > >'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/graph_concepts.hpp:223:5: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:99:5: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; BinaryFunction = boost::closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = boost::bellman_visitor<>]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:179:16: required from 'bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:198:11: required from 'bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/bellman_ford_shortest_paths.hpp:213:7: required from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; Size = long unsigned int; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, int, int&>; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>, int, int&, int Node::*>, double, double&>, boost::vertex_distance_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, EdgeProperties, double EdgeProperties::*>, boost::edge_weight_t, boost::no_property> >]'
prog.cc:81:5: required from here
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/concept_check.hpp:154:9: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >& boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >::operator=(const boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >&)' is deprecated [-Wdeprecated-copy]
154 | a = x; // const required for argument to assignment
| ~~^~~
In file included from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adjacency_list.hpp:34,
from /opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/adjacency_list.hpp:223,
from prog.cc:13:
/opt/wandbox/boost-1.69.0/gcc-head/include/boost/graph/detail/adj_list_edge_iterator.hpp:46:14: note: because 'boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >' has user-provided 'boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::adj_list_edge_iterator(const self&) [with VertexIterator = boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >; OutEdgeIterator = boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>; Graph = boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties>; boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::self = boost::detail::adj_list_edge_iterator<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<void*> >, boost::detail::out_edge_iter<boost::unordered::iterator_detail::c_iterator<boost::unordered::detail::ptr_node<boost::detail::stored_edge_property<void*, EdgeProperties> > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::hash_setS, boost::hash_setS, boost::directedS, Node, EdgeProperties> >]'
46 | inline adj_list_edge_iterator(const self& x)
| ^~~~~~~~~~~~~~~~~~~~~~
Exit Code:
1