update ceph source to reef 18.1.2

[ceph.git] / ceph / src / boost / libs / graph_parallel / test / distributed_shortest_paths_test.cpp

diff --git a/ceph/src/boost/libs/graph_parallel/test/distributed_shortest_paths_test.cpp b/ceph/src/boost/libs/graph_parallel/test/distributed_shortest_paths_test.cpp
index fce4c255e1a469c5e35d2c9de1c9f1df37ee557c..f71431c206ececd2c2e3f7df8e88924fb5e0c2f2 100644 (file)
--- a/ceph/src/boost/libs/graph_parallel/test/distributed_shortest_paths_test.cpp
+++ b/ceph/src/boost/libs/graph_parallel/test/distributed_shortest_paths_test.cpp
@@ -19,7 +19,7 @@
 #include <boost/graph/distributed/adjacency_list.hpp>
 #include <boost/graph/graphviz.hpp>
 #include <boost/random.hpp>
-#include <boost/test/minimal.hpp>
+#include <boost/core/lightweight_test.hpp>
 #include <boost/graph/iteration_macros.hpp>
 
 #include <iostream>
@@ -194,7 +194,7 @@ test_distributed_shortest_paths(int n, double p, int c, int seed)
                         get(&WeightedEdge::weight, g));
 }
 
-int test_main(int argc, char* argv[])
+int main(int argc, char* argv[])
 {
   mpi::environment env(argc, argv);
 
@@ -210,5 +210,5 @@ int test_main(int argc, char* argv[])
 
   test_distributed_shortest_paths(n, p, c, seed);
 
-  return 0;
+  return boost::report_errors();
 }