"g++-13"   -fvisibility-inlines-hidden -std=c++20 -Wall -Wextra -fPIC -m64 -pthread -O0 -fno-inline -Wall -fvisibility=hidden  -DBOOST_ALL_NO_LIB=1 -DBOOST_COBALT_USE_STD_PMR=1   -I".."  -c -o "/var/boost/run/results/boost/bin.v2/libs/graph/test/layout_test.test/gcc-13~c++20~warn/debug/x86_64/debug-symbols-off/threading-multi/visibility-hidden/layout_test.o" "../libs/graph/test/layout_test.cpp"

In file included from ../boost/tuple/tuple.hpp:28,
                 from ../boost/graph/graph_traits.hpp:16,
                 from ../boost/graph/fruchterman_reingold.hpp:13,
                 from ../libs/graph/test/layout_test.cpp:16:
../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::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >; U2 = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >; T0 = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >&; T1 = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >&; 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]':
../boost/graph/johnson_all_pairs_shortest.hpp:118:35:   required from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; DistanceMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; VertexID = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]'
../boost/graph/johnson_all_pairs_shortest.hpp:150:44:   required from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, DistanceZero) [with VertexAndEdgeListGraph = const adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; DistanceMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; VertexID = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; DistanceZero = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:239:54:   required from 'bool boost::detail::graph::kamada_kawai_spring_layout_impl<Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap>::run() [with Topology = boost::square_topology<>; Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point> >, boost::property<boost::edge_weight_t, double> >; PositionMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point> >, boost::property<boost::edge_weight_t, double> >, boost::convex_topology<2>::point, boost::convex_topology<2>::point&, vertex_position_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, void*, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; EdgeOrSideLength = boost::detail::graph::edge_or_side<false, double>; Done = kamada_kawai_done; VertexIndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point> >, boost::property<boost::edge_weight_t, double> >, int, const int&, boost::vertex_index_t>; DistanceMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; SpringStrengthMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; PartialDerivativeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point> >, boost::property<boost::edge_weight_t, double> >, int, const int&, boost::vertex_index_t>, boost::convex_topology<2>::point_difference, boost::convex_topology<2>::point_difference&>]'
../boost/graph/kamada_kawai_spring_layout.hpp:609:19:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; VertexIndexMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; DistanceMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; SpringStrengthMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; PartialDerivativeMap = iterator_property_map<__gnu_cxx::__normal_iterator<convex_topology<2>::point_difference*, std::vector<convex_topology<2>::point_difference> >, adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:635:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type, VertexIndexMap) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; VertexIndexMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:653:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:668:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done]'
../libs/graph/test/layout_test.cpp:223:41:   required from 'void test_cube(Graph*) [with Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point> >, boost::property<boost::edge_weight_t, double> >]'
../libs/graph/test/layout_test.cpp:403:14:   required from here
../boost/tuple/detail/tuple_basic.hpp:592:16: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >& boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >::operator=(const boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >&)' is deprecated [-Wdeprecated-copy]
  592 |     this->head = k.first;
      |     ~~~~~~~~~~~^~~~~~~~~
In file included from ../boost/graph/detail/adjacency_list.hpp:35,
                 from ../boost/graph/adjacency_list.hpp:255,
                 from ../boost/graph/johnson_all_pairs_shortest.hpp:30,
                 from ../boost/graph/kamada_kawai_spring_layout.hpp:15,
                 from ../libs/graph/test/layout_test.cpp:18:
../boost/graph/detail/adj_list_edge_iterator.hpp:50:16: note: because 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >' has user-provided 'boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::adj_list_edge_iterator(const self&) [with VertexIterator = boost::range_detail::integer_iterator<long unsigned int>; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>; self = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]'
   50 |         inline adj_list_edge_iterator(const self& x)
      |                ^~~~~~~~~~~~~~~~~~~~~~
../boost/tuple/detail/tuple_basic.hpp:593:21: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >& boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >::operator=(const boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >&)' is deprecated [-Wdeprecated-copy]
  593 |     this->tail.head = k.second;
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~
../boost/graph/detail/adj_list_edge_iterator.hpp:50:16: note: because 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >' has user-provided 'boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::adj_list_edge_iterator(const self&) [with VertexIterator = boost::range_detail::integer_iterator<long unsigned int>; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>; self = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]'
   50 |         inline adj_list_edge_iterator(const self& x)
      |                ^~~~~~~~~~~~~~~~~~~~~~
In file included from ../boost/property_map/property_map.hpp:20,
                 from ../boost/graph/properties.hpp:19,
                 from ../boost/graph/named_function_params.hpp:26,
                 from ../boost/graph/fruchterman_reingold.hpp:14:
../boost/concept_check.hpp: In instantiation of 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]':
../boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]'
../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::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]'
../boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >'
../boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >'
../boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]'
../boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
../boost/graph/kamada_kawai_spring_layout.hpp:609:19:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; VertexIndexMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; DistanceMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; SpringStrengthMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; PartialDerivativeMap = iterator_property_map<__gnu_cxx::__normal_iterator<convex_topology<2>::point_difference*, std::vector<convex_topology<2>::point_difference> >, adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:635:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type, VertexIndexMap) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; VertexIndexMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:653:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:668:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done]'
../libs/graph/test/layout_test.cpp:223:41:   required from 'void test_cube(Graph*) [with Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point> >, boost::property<boost::edge_weight_t, double> >]'
../libs/graph/test/layout_test.cpp:403:14:   required from here
../boost/concept_check.hpp:147:9: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >& boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >::operator=(const boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >&)' is deprecated [-Wdeprecated-copy]
  147 |       a = b;             // require assignment operator
      |       ~~^~~
../boost/graph/detail/adj_list_edge_iterator.hpp:50:16: note: because 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >' has user-provided 'boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::adj_list_edge_iterator(const self&) [with VertexIterator = boost::range_detail::integer_iterator<long unsigned int>; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>; self = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]'
   50 |         inline adj_list_edge_iterator(const self& x)
      |                ^~~~~~~~~~~~~~~~~~~~~~
../boost/concept_check.hpp: In instantiation of 'void boost::Assignable<TT>::const_constraints(const TT&) [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]':
../boost/concept_check.hpp:149:7:   required from 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]'
../boost/concept/usage.hpp:20:48:   required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]'
../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::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]'
../boost/concept_check.hpp:145:5:   required from 'struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >'
../boost/concept_check.hpp:502:3:   required from 'struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >'
../boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
../boost/graph/kamada_kawai_spring_layout.hpp:609:19:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; VertexIndexMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; DistanceMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; SpringStrengthMatrix = __gnu_cxx::__normal_iterator<std::vector<double, std::allocator<double> >*, std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > > >; PartialDerivativeMap = iterator_property_map<__gnu_cxx::__normal_iterator<convex_topology<2>::point_difference*, std::vector<convex_topology<2>::point_difference> >, adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:635:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type, VertexIndexMap) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; VertexIndexMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, int, const int&, vertex_index_t>; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:653:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename property_traits<DistanceMap>::value_type) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done; typename property_traits<DistanceMap>::value_type = double]'
../boost/graph/kamada_kawai_spring_layout.hpp:668:38:   required from 'bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, detail::graph::edge_or_side<EdgeOrSideLength, T>, Done) [with Topology = square_topology<>; Graph = adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >; PositionMap = adj_list_vertex_property_map<adjacency_list<listS, listS, undirectedS, property<vertex_index_t, int, property<vertex_position_t, convex_topology<2>::point> >, property<edge_weight_t, double> >, convex_topology<2>::point, convex_topology<2>::point&, vertex_position_t>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, void*, property<edge_weight_t, double>, edge_weight_t>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done]'
../libs/graph/test/layout_test.cpp:223:41:   required from 'void test_cube(Graph*) [with Graph = boost::adjacency_list<boost::listS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<vertex_position_t, boost::convex_topology<2>::point> >, boost::property<boost::edge_weight_t, double> >]'
../libs/graph/test/layout_test.cpp:403:14:   required from here
../boost/concept_check.hpp:154:9: warning: implicitly-declared 'boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::det...

[The content has been trimmed by the report system because it exceeds 65536 bytes]            

"g++-13"    -o "/var/boost/run/results/boost/bin.v2/libs/graph/test/layout_test.test/gcc-13~c++20~warn/debug/x86_64/debug-symbols-off/threading-multi/visibility-hidden/layout_test" -Wl,--start-group "/var/boost/run/results/boost/bin.v2/libs/graph/test/layout_test.test/gcc-13~c++20~warn/debug/x86_64/debug-symbols-off/threading-multi/visibility-hidden/layout_test.o"  -Wl,-Bstatic  -Wl,-Bdynamic -lrt -Wl,--end-group -fPIC -m64 -pthread -fvisibility=hidden -fvisibility-inlines-hidden 

            

Regular polygon layout with 5 points.
           E       
                   
                   
                   
D                  
                   
                   
                   
                   
                  A
                   
                   
                   
                   
C                  
                   
                   
                   
           B       
(A, E) (A, B) (A, D) (B, F) (B, C) (C, D) (C, G) (D, H) (E, H) (E, F) (F, G) (G, H) 
Cube layout (Kamada-Kawai).
                       G              
                                      
                                      
                                      
                                      
                                      
      F                               
                                      
                                      
                                      
                                      
                                      
                                     C
                                      
                                      
                                      
                                      
                                      
               H                      
                      B               
                                      
                                      
                                      
E                                     
                                      
                                      
                                      
                                      
                                      
                                      
                               D      
                                      
                                      
                                      
                                      
                                      
               A                      
Cube layout (Fruchterman-Reingold).
                                 D         
                                           
                                           
                                           
         A                                 
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                        H                  
                                           
                                           
                                           
                                           
                                           
E                                         C
                                           
                                           
                                           
                                           
                  B                        
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                           
                                G          
                                           
                                           
                                           
         F                                 
(A, B) (A, C) (B, C) (B, D) (B, E) (C, E) (C, F) (D, E) (D, G) (D, H) (E, F) (E, H) (E, I) (F, I) (F, J) (G, H) (H, I) (I, J) 
Triangular layout (Kamada-Kawai).
                                  I                J
                 H                                  
G                                                   
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                           F        
                          E                         
         D                                          
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                   B               C                
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                                                    
                           A                        
Triangular layout (Fruchterman-Reingold).
          A                                                   
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                        B                                     
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
         C                                                    
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                           D                  
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                       E                                      
                                                              
                                                              
                                                              
                                                              
                                                             G
                                                              
                                                              
                                                              
     F                                                        
                                                              
                                         H                    
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                   I                                          
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
                                                              
J                                                             
(A, B) (B, C) (C, A) (D, E) (E, F) (F, G) (G, H) (H, D) (D, F) (F, H) (H, E) (E, G) (G, D) 
Disconnected layout (Fruchterman-Reingold).
                                                                                      A             C
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                    B
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
           D                                                                                         
                                                                                                     
                                                                                                     
                                                                                                     
F                                                                                                    
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                   H                                                                                 
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
                                                                                                     
E                                                                                                    
                                                                                                     
                                                                                                     
                                                                                                     
            G                                                                                        
No errors detected.

EXIT STATUS: 0