update boost

linx64/include/boost/graph/distributed/detail/dijkstra_shortest_paths.hpp

@@ -14,6 +14,7 @@
 #endif
 
 #include <boost/property_map/property_map.hpp>
+#include <boost/property_map/parallel/parallel_property_maps.hpp>
 
 namespace boost { namespace graph { namespace distributed { namespace detail {
 

linx64/include/boost/graph/distributed/detail/mpi_process_group.ipp

@@ -28,6 +28,7 @@
 #include <queue>
 #include <stack>
 #include <list>
+#include <map>
 #include <boost/graph/distributed/detail/tag_allocator.hpp>
 #include <stdio.h>
 
@@ -839,10 +840,19 @@ all_gather(const mpi_process_group& pg, InputIterator first,
                              &sizes[0], 1, MPI_INT,
                              communicator(pg));
   BOOST_ASSERT(result == MPI_SUCCESS);
+  (void)result;
 
   // Adjust sizes based on the number of bytes
-  std::transform(sizes.begin(), sizes.end(), sizes.begin(),
-                 std::bind2nd(std::multiplies<int>(), sizeof(T)));
+  //
+  // std::transform(sizes.begin(), sizes.end(), sizes.begin(),
+  //               std::bind2nd(std::multiplies<int>(), sizeof(T)));
+  //
+  // std::bind2nd has been removed from C++17
+
+  for( std::size_t i = 0, n = sizes.size(); i < n; ++i )
+  {
+    sizes[ i ] *= sizeof( T );
+  }
 
   // Compute displacements
   std::vector<int> displacements;
@@ -880,6 +890,7 @@ process_subgroup(const mpi_process_group& pg,
   MPI_Group current_group;
   int result = MPI_Comm_group(communicator(pg), &current_group);
   BOOST_ASSERT(result == MPI_SUCCESS);
+  (void)result;
 
   MPI_Group new_group;
   result = MPI_Group_incl(current_group, ranks.size(), &ranks[0], &new_group);