Test output: teeks99-05-mg8-2a-32onarmv7l - graph - layout_test / gcc-8~c++2a
Rev 9dae34c66db664e04b92ce65f33d238cb5fb1c44 / Thu, 21 Nov 2024 00:29:35 +0000
Compile [2024-11-21 15:34:40 UTC]: succeed

"g++-8"   -fvisibility-inlines-hidden -std=c++2a -fPIC -pthread -O0 -fno-inline -Wall -fvisibility=hidden  -DBOOST_ALL_NO_LIB=1 -DBOOST_COBALT_USE_STD_PMR=1   -I".."  -c -o "/mnt/fs1/teeks99-05/run/results/boost/bin.v2/libs/graph/test/layout_test.test/gcc-8~c++2a/debug/arm_32/debug-symbols-off/threading-multi/visibility-hidden/layout_test.o" "../libs/graph/test/layout_test.cpp"

../libs/graph/test/layout_test.cpp: In function ???void test_circle_layout(Graph*, typename boost::graph_traits<Graph>::vertices_size_type) [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:115:24: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     circle_graph_layout(g, get(vertex_position, g), 10.0);
     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:119:23: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     print_graph_layout(g, get(vertex_position, g), topology);
     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp: In function ???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:221:24: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     circle_graph_layout(g, get(vertex_position, g), 25.0);
     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:223:41: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     bool ok = kamada_kawai_spring_layout(g, get(vertex_position, g),
               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
         get(edge_weight, g), square_topology<>(50.0), side_length(50.0),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         kamada_kawai_done());
         ~~~~~~~~~~~~~~~~~~~~             
../libs/graph/test/layout_test.cpp:229:23: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     print_graph_layout(g, get(vertex_position, g), square_topology<>(50.));
     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:239:24: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     random_graph_layout(g, get(vertex_position, g), rect_top);
     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:241:47: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
     fruchterman_reingold_force_directed_layout(g, get(vertex_position, g),
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
         topology, square_distance_attractive_force(),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         square_distance_repulsive_force(), all_force_pairs(),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         linear_cooling< double >(100),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
         make_iterator_property_map(displacements.begin(), get(vertex_index, g),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             Topology::point_difference_type()));
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:241:47: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
../libs/graph/test/layout_test.cpp:241:47: note: parameter passing for argument of type ???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, int&, boost::vertex_index_t>, boost::convex_topology<2>::point_difference, boost::convex_topology<2>::point_difference&>??? changed in GCC 7.1
../libs/graph/test/layout_test.cpp:249:23: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     print_graph_layout(g, get(vertex_position, g), square_topology<>(50.));
     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp: In function ???void test_triangular(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:301:24: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     circle_graph_layout(g, get(vertex_position, g), 25.0);
     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:303:41: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     bool ok = kamada_kawai_spring_layout(g, get(vertex_position, g),
               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
         get(edge_weight, g), topology, side_length(50.0), kamada_kawai_done());
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:308:23: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     print_graph_layout(g, get(vertex_position, g), square_topology<>(50.));
     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:313:24: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     random_graph_layout(g, get(vertex_position, g), rect_top);
     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:319:47: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     fruchterman_reingold_force_directed_layout(g, get(vertex_position, g),
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
         topology,
         ~~~~~~~~~                              
         attractive_force(square_distance_attractive_force())
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             .cooling(linear_cooling< double >(100)));
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:325:23: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     print_graph_layout(g, get(vertex_position, g), square_topology<>(50.));
     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp: In function ???void test_disconnected(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:367:24: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     circle_graph_layout(g, get(vertex_position, g), 25.0);
     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:369:41: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     bool ok = kamada_kawai_spring_layout(g, get(vertex_position, g),
               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
         get(edge_weight, g), square_topology<>(50.0), side_length(50.0),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         kamada_kawai_done());
         ~~~~~~~~~~~~~~~~~~~~             
../libs/graph/test/layout_test.cpp:376:24: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     random_graph_layout(g, get(vertex_position, g), rect_top);
     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:382:47: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     fruchterman_reingold_force_directed_layout(g, get(vertex_position, g),
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
         topology,
         ~~~~~~~~~                              
         attractive_force(square_distance_attractive_force())
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             .cooling(linear_cooling< double >(50)));
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp:388:23: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     print_graph_layout(g, get(vertex_position, g), square_topology<>(50.));
     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from ../libs/graph/test/layout_test.cpp:19:
../boost/graph/circle_layout.hpp: In function ???void boost::circle_graph_layout(const VertexListGraph&, PositionMap, Radius) [with VertexListGraph = 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>; Radius = double]???:
../boost/graph/circle_layout.hpp:33:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 void circle_graph_layout(
      ^~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp: In function ???void print_graph_layout(const Graph&, PositionMap, const Topology&) [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> >; 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>; Topology = boost::square_topology<>]???:
../libs/graph/test/layout_test.cpp:42:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 void print_graph_layout(
      ^~~~~~~~~~~~~~~~~~
In file included from ../libs/graph/test/layout_test.cpp:18:
../boost/graph/kamada_kawai_spring_layout.hpp: In function ???bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, boost::detail::graph::edge_or_side<EdgeOrSideLength, T>, Done) [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>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done]???:
../boost/graph/kamada_kawai_spring_layout.hpp:662:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 bool kamada_kawai_spring_layout(const Graph& g, PositionMap position,
      ^~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/kamada_kawai_spring_layout.hpp:662:6: note: parameter passing for argument of type ???boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, void*, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:668:38: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     return kamada_kawai_spring_layout(g, position, weight, topology,
            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         edge_or_side_length, done, weight_type(1));
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../libs/graph/test/layout_test.cpp: In function ???void dump_graph_layout(std::__cxx11::string, const Graph&, PositionMap) [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> >; 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>]???:
../libs/graph/test/layout_test.cpp:78:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 void dump_graph_layout(std::string name, const Graph& g, PositionMap position)
      ^~~~~~~~~~~~~~~~~
In file included from ../libs/graph/test/layout_test.cpp:17:
../boost/graph/random_layout.hpp: In function ???void boost::random_graph_layout(const Graph&, PositionMap, const Topology&) [with Topology = boost::rectangle_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>]???:
../boost/graph/random_layout.hpp:24:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 void random_graph_layout(
      ^~~~~~~~~~~~~~~~~~~
In file included from ../boost/graph/properties.hpp:19,
                 from ../boost/graph/named_function_params.hpp:26,
                 from ../boost/graph/fruchterman_reingold.hpp:14,
                 from ../libs/graph/test/layout_test.cpp:16:
../boost/property_map/property_map.hpp: In function ???boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >; Value = boost::convex_topology<2>::point_difference; ID = 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, int&, boost::vertex_index_t>]???:
../boost/property_map/property_map.hpp:364:3: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
   make_iterator_property_map(RAIter iter, ID id, Value) {
   ^~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/property_map/property_map.hpp:367:25: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
     return PMap(iter, id);
                         ^
In file included from ../libs/graph/test/layout_test.cpp:16:
../boost/graph/fruchterman_reingold.hpp: In function ???void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [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>; AttractiveForce = boost::square_distance_attractive_force; RepulsiveForce = boost::square_distance_repulsive_force; ForcePairs = boost::all_force_pairs; Cooling = boost::linear_cooling<double>; DisplacementMap = 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, int&, boost::vertex_index_t>, boost::convex_topology<2>::point_difference, boost::convex_topology<2>::point_difference&>]???:
../boost/graph/fruchterman_reingold.hpp:310:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 void fruchterman_reingold_force_directed_layout(const Graph& g,
      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/fruchterman_reingold.hpp:310:6: note: parameter passing for argument of type ???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, int&, boost::vertex_index_t>, boost::convex_topology<2>::point_difference, boost::convex_topology<2>::point_difference&>??? changed in GCC 7.1
../boost/graph/fruchterman_reingold.hpp: In function ???void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const boost::bgl_named_params<Param, Tag, Rest>&) [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>; Param = boost::linear_cooling<double>; Tag = boost::cooling_t; Rest = boost::bgl_named_params<boost::square_distance_attractive_force, boost::attractive_force_t, boost::no_property>]???:
../boost/graph/fruchterman_reingold.hpp:429:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 void fruchterman_reingold_force_directed_layout(const Graph& g,
      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/fruchterman_reingold.hpp:436:47: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     detail::fr_force_directed_layout< D >::run(g, position, topology,
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
         choose_param(get_param(params, attractive_force_t()),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             square_distance_attractive_force()),
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         choose_param(get_param(params, repulsive_force_t()),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             square_distance_repulsive_force()),
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         choose_param(get_param(params, force_pairs_t()),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             make_grid_force_pairs(topology, position, g)),
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         choose_param(
         ~~~~~~~~~~~~~                          
             get_param(params, cooling_t()), linear_cooling< double >(100)),
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         get_param(params, vertex_displacement_t()), params);
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from ../libs/graph/test/layout_test.cpp:18:
../boost/graph/kamada_kawai_spring_layout.hpp: In function ???bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, boost::detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename boost::property_traits<DistanceMap>::value_type) [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>; T = double; bool EdgeOrSideLength = false; Done = kamada_kawai_done]???:
../boost/graph/kamada_kawai_spring_layout.hpp:647:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 bool kamada_kawai_spring_layout(const Graph& g, PositionMap position,
      ^~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/kamada_kawai_spring_layout.hpp:647:6: note: parameter passing for argument of type ???boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, void*, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:653:38: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     return kamada_kawai_spring_layout(g, position, weight, topology,
            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         edge_or_side_length, done, spring_constant, get(vertex_index, g));
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from ../boost/graph/properties.hpp:19,
                 from ../boost/graph/named_function_params.hpp:26,
                 from ../boost/graph/fruchterman_reingold.hpp:14,
                 from ../libs/graph/test/layout_test.cpp:16:
../boost/property_map/property_map.hpp: In constructor ???boost::iterator_property_map<RandomAccessIterator, IndexMap, T, R>::iterator_property_map(RandomAccessIterator, const IndexMap&) [with RandomAccessIterator = __gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >; IndexMap = 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, int&, boost::vertex_index_t>; T = boost::convex_topology<2>::point_difference; R = boost::convex_topology<2>::point_difference&]???:
../boost/property_map/property_map.hpp:337:12: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
     inline iterator_property_map(
            ^~~~~~~~~~~~~~~~~~~~~
In file included from ../libs/graph/test/layout_test.cpp:16:
../boost/graph/fruchterman_reingold.hpp: In static member function ???static void boost::detail::fr_force_directed_layout<boost::param_not_found>::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params<Param, Tag, Rest>&) [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>; AttractiveForce = boost::square_distance_attractive_force; RepulsiveForce = boost::square_distance_repulsive_force; ForcePairs = boost::grid_force_pairs<boost::square_topology<>, 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> >; Cooling = boost::linear_cooling<double>; Param = boost::linear_cooling<double>; Tag = boost::cooling_t; Rest = boost::bgl_named_params<boost::square_distance_attractive_force, boost::attractive_force_t, boost::no_property>]???:
../boost/graph/fruchterman_reingold.hpp:408:21: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
         static void run(const Graph& g, PositionMap position,
                     ^~~
../boost/graph/fruchterman_reingold.hpp:416:55: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
             fruchterman_reingold_force_directed_layout(g, position, topology,
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
                 attractive_force, repulsive_force, force_pairs, cool,
                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
                 make_iterator_property_map(displacements.begin(),
                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
                     choose_const_pmap(
                     ~~~~~~~~~~~~~~~~~~                 
                         get_param(params, vertex_index), g, vertex_index),
                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
                     PointDiff()));
                     ~~~~~~~~~~~~~                      
../boost/graph/fruchterman_reingold.hpp:416:55: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
../boost/graph/fruchterman_reingold.hpp:416:55: note: parameter passing for argument of type ???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&>??? changed in GCC 7.1
In file included from ../libs/graph/test/layout_test.cpp:18:
../boost/graph/kamada_kawai_spring_layout.hpp: In function ???bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, boost::detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename boost::property_traits<DistanceMap>::value_type, VertexIndexMap) [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>; T = double; bool EdgeOrSideLength = false; 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>]???:
../boost/graph/kamada_kawai_spring_layout.hpp:618:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 bool kamada_kawai_spring_layout(const Graph& g, PositionMap position,
      ^~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/kamada_kawai_spring_layout.hpp:618:6: note: parameter passing for argument of type ???boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, void*, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:635:38: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
     return kamada_kawai_spring_layout(g, position, weight, topology,
            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         edge_or_side_length, done, spring_constant, index, distance.begin(),
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
         spring_strength.begin(),
         ~~~~~~~~~~~~~~~~~~~~~~~~      
         make_iterator_property_map(partial_derivatives.begin(), index,
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             typename Topology::point_difference_type()));
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/kamada_kawai_spring_layout.hpp:635:38: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:635:38: note: parameter passing for argument of type ???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&>??? changed in GCC 7.1
In file included from ../libs/graph/test/layout_test.cpp:16:
../boost/graph/fruchterman_reingold.hpp: In constructor ???boost::grid_force_pairs<Topology, PositionMap>::grid_force_pairs(const Topology&, PositionMap, const 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> >; Topology = boost::square_topology<>; 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>]???:
../boost/graph/fruchterman_reingold.hpp:103:14: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
     explicit grid_force_pairs(
              ^~~~~~~~~~~~~~~~
In file included from ../boost/graph/properties.hpp:19,
                 from ../boost/graph/named_function_params.hpp:26,
                 from ../boost/graph/fruchterman_reingold.hpp:14,
                 from ../libs/graph/test/layout_test.cpp:16:
../boost/property_map/property_map.hpp: In function ???boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >; Value = boost::convex_topology<2>::point_difference; ID = 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/property_map/property_map.hpp:364:3: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
   make_iterator_property_map(RAIter iter, ID id, Value) {
   ^~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/property_map/property_map.hpp:367:25: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
     return PMap(iter, id);
                         ^
In file included from ../libs/graph/test/layout_test.cpp:16:
../boost/graph/fruchterman_reingold.hpp: In function ???void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [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>; AttractiveForce = boost::square_distance_attractive_force; RepulsiveForce = boost::square_distance_repulsive_force; ForcePairs = boost::grid_force_pairs<boost::square_topology<>, 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> >; Cooling = boost::linear_cooling<double>; DisplacementMap = 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/fruchterman_reingold.hpp:310:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 void fruchterman_reingold_force_directed_layout(const Graph& g,
      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/fruchterman_reingold.hpp:310:6: note: parameter passing for argument of type ???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&>??? changed in GCC 7.1
In file included 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/adjacency_list.hpp: In function ???std::pair<typename Config::edge_descriptor, bool> boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, boost::undirected_graph_helper<C>&) [with Config = boost::detail::adj_list_gen<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::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::no_property, boost::listS>::config]???:
../boost/graph/detail/adjacency_list.hpp:1087:9: note: parameter passing for argument of type ???std::__cxx11::list<boost::list_edge<void*, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::list_edge<void*, boost::property<boost::edge_weight_t, double> > > >::const_iterator??? {aka ???std::_List_const_iterator<boost::list_edge<void*, boost::property<boost::edge_weight_t, double> > >???} changed in GCC 7.1
         g.m_edges.erase(p_iter);
         ^
In file included from ../libs/graph/test/layout_test.cpp:18:
../boost/graph/kamada_kawai_spring_layout.hpp: In function ???bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, const Topology&, boost::detail::graph::edge_or_side<EdgeOrSideLength, T>, Done, typename boost::property_traits<DistanceMap>::value_type, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap) [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>; T = double; bool EdgeOrSideLength = false; 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:588:6: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
 bool kamada_kawai_spring_layout(const Graph& g, PositionMap position,
      ^~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/kamada_kawai_spring_layout.hpp:588:6: note: parameter passing for argument of type ???boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, void*, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:588:6: note: parameter passing for argument of type ???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&>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:606:9: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
         alg(topology, g, position, weight, edge_or_side_length, done,
         ^~~
../boost/graph/kamada_kawai_spring_layout.hpp:606:9: note: parameter passing for argument of type ???boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, void*, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:606:9: note: parameter passing for argument of type ???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&>??? changed in GCC 7.1
In file included from ../boost/graph/properties.hpp:19,
                 from ../boost/graph/named_function_params.hpp:26,
                 from ../boost/graph/fruchterman_reingold.hpp:14,
                 from ../libs/graph/test/layout_test.cpp:16:
../boost/property_map/property_map.hpp: In constructor ???boost::iterator_property_map<RandomAccessIterator, IndexMap, T, R>::iterator_property_map(RandomAccessIterator, const IndexMap&) [with RandomAccessIterator = __gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >; IndexMap = 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>; T = boost::convex_topology<2>::point_difference; R = boost::convex_topology<2>::point_difference&]???:
../boost/property_map/property_map.hpp:337:12: note: parameter passing for argument of type ???__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology<2>::point_difference> >??? changed in GCC 7.1
     inline iterator_property_map(
            ^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/8/list:64,
                 from ../boost/graph/fruchterman_reingold.hpp:19,
                 from ../libs/graph/test/layout_test.cpp:16:
/usr/include/c++/8/bits/list.tcc: In member function ???std::__cxx11::list<_Tp, _Alloc>::iterator std::__cxx11::list<_Tp, _Alloc>::erase(std::__cxx11::list<_Tp, _Alloc>::const_iterator) [with _Tp = boost::list_edge<void*, boost::property<boost::edge_weight_t, double> >; _Alloc = std::allocator<boost::list_edge<void*, boost::property<boost::edge_weight_t, double> > >]???:
/usr/include/c++/8/bits/list.tcc:150:5: note: parameter passing for argument of type ???std::__cxx11::list<boost::list_edge<void*, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::list_edge<void*, boost::property<boost::edge_weight_t, double> > > >::const_iterator??? {aka ???std::_List_const_iterator<boost::list_edge<void*, boost::property<boost::edge_weight_t, double> > >???} changed in GCC 7.1
     list<_Tp, _Alloc>::
     ^~~~~~~~~~~~~~~~~
In file included from ../libs/graph/test/layout_test.cpp:18:
../boost/graph/kamada_kawai_spring_layout.hpp: In constructor ???boost::detail::graph::kamada_kawai_spring_layout_impl<Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap>::kamada_kawai_spring_layout_impl(const Topology&, const Graph&, PositionMap, WeightMap, EdgeOrSideLength, Done, boost::detail::graph::kamada_kawai_spring_layout_impl<Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap>::weight_type, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap) [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:168:13: note: parameter passing for argument of type ???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>??? changed in GCC 7.1
             kamada_kawai_spring_layout_impl(const Topology& topology,
             ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../boost/graph/kamada_kawai_spring_layout.hpp:168:13: note: parameter passing for argument of type ???boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, void*, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>??? changed in GCC 7.1
../boost/graph/kamada_kawai_spring_layout.hpp:168:13: note: parameter passing for argument of type ???boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::convex_topology<2>::point_difference*, std::vector<boost::convex_topology...

[The content has been trimmed by the report system because it exceeds 65536 bytes]            
Link [2024-11-21 15:34:40 UTC]: succeed

"g++-8"    -o "/mnt/fs1/teeks99-05/run/results/boost/bin.v2/libs/graph/test/layout_test.test/gcc-8~c++2a/debug/arm_32/debug-symbols-off/threading-multi/visibility-hidden/layout_test" -Wl,--start-group "/mnt/fs1/teeks99-05/run/results/boost/bin.v2/libs/graph/test/layout_test.test/gcc-8~c++2a/debug/arm_32/debug-symbols-off/threading-multi/visibility-hidden/layout_test.o"  -Wl,-Bstatic  -Wl,-Bdynamic -lrt -Wl,--end-group -fPIC -pthread -fvisibility=hidden -fvisibility-inlines-hidden 

            
Run [2024-11-21 15:34:40 UTC]: succeed

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