import new upstream nautilus stable release 14.2.8

[ceph.git] / ceph / src / boost / libs / graph / test / betweenness_centrality_test.cpp

diff --git a/ceph/src/boost/libs/graph/test/betweenness_centrality_test.cpp b/ceph/src/boost/libs/graph/test/betweenness_centrality_test.cpp
index 585e97deb4905abdde52e01e4394b070000f4458..9fb69cf703507c0ea5358425bdfd9e68a29583a3 100644 (file)
--- a/ceph/src/boost/libs/graph/test/betweenness_centrality_test.cpp
+++ b/ceph/src/boost/libs/graph/test/betweenness_centrality_test.cpp
@@ -239,8 +239,6 @@ void randomly_add_edges(MutableGraph& g, double edge_probability)
 {
   typedef typename graph_traits<MutableGraph>::directed_category
     directed_category;
-  const bool is_undirected = 
-    is_same<directed_category, undirected_tag>::value;
 
   minstd_rand gen;
   uniform_01<minstd_rand, double> rand_gen(gen);
@@ -250,7 +248,7 @@ void randomly_add_edges(MutableGraph& g, double edge_probability)
   for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) {
     vertex v = *vi;
     typename graph_traits<MutableGraph>::vertex_iterator wi 
-      = is_undirected? vi : vertices(g).first;
+      = is_same<directed_category, undirected_tag>::value ? vi : vertices(g).first;
     while (wi != vi_end) {
       vertex w = *wi++;
       if (v != w) {