diff --git a/example/bellman-example.cpp b/example/bellman-example.cpp
index e6ec8750..85dd5ae7 100644
--- a/example/bellman-example.cpp
+++ b/example/bellman-example.cpp
@@ -9,7 +9,7 @@
 #include <vector>
 #include <iostream>
 #include <fstream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/bellman_ford_shortest_paths.hpp>
 
@@ -95,7 +95,7 @@ main()
 
   if (r)
     for (i = 0; i < N; ++i)
-      std::cout << name[i] << ": " << std::setw(3) << distance[i]
+      std::cout << name[i] << ": " << boost::detail::setw(3) << distance[i]
         << " " << name[parent[i]] << std::endl;
   else
     std::cout << "negative cycle" << std::endl;
diff --git a/example/closeness_centrality.cpp b/example/closeness_centrality.cpp
index b5aa4776..5682d8f3 100644
--- a/example/closeness_centrality.cpp
+++ b/example/closeness_centrality.cpp
@@ -6,7 +6,7 @@
 
 //[closeness_centrality_example
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -76,7 +76,7 @@ main(int argc, char *argv[])
     // Print the closeness centrality of each vertex.
     graph_traits<Graph>::vertex_iterator i, end;
     for(tie(i, end) = vertices(g); i != end; ++i) {
-        cout << setw(12) << setiosflags(ios::left)
+        cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left)
              << g[*i].name << get(cm, *i) << endl;
     }
 
diff --git a/example/clustering_coefficient.cpp b/example/clustering_coefficient.cpp
index 70f8e731..2cf9bfb8 100644
--- a/example/clustering_coefficient.cpp
+++ b/example/clustering_coefficient.cpp
@@ -7,7 +7,7 @@
 
 //[code_clustering_coefficient
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -59,7 +59,7 @@ main(int argc, char *argv[])
     // Print the clustering coefficient of each vertex.
     graph_traits<Graph>::vertex_iterator i, end;
     for(tie(i, end) = vertices(g); i != end; ++i) {
-        cout << setw(12) << setiosflags(ios::left)
+        cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left)
                 << g[*i].name << get(cm, *i) << endl;
     }
     cout << "mean clustering coefficient: " << cc << endl;
diff --git a/example/degree_centrality.cpp b/example/degree_centrality.cpp
index 7da764e1..ab745f7f 100644
--- a/example/degree_centrality.cpp
+++ b/example/degree_centrality.cpp
@@ -7,7 +7,7 @@
 
 //[degree_centrality_example
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -58,7 +58,7 @@ main(int argc, char *argv[])
     // Print the degree centrality of each vertex.
     graph_traits<Graph>::vertex_iterator i, end;
     for(tie(i, end) = vertices(g); i != end; ++i) {
-        cout << setiosflags(ios::left) << setw(12)
+        cout << boost::detail::setiosflags(ios::left) << boost::detail::setw(12)
              << g[*i].name << cm[*i] << endl;
     }
 
diff --git a/example/eccentricity.cpp b/example/eccentricity.cpp
index 3e16e6f2..2ac245c0 100644
--- a/example/eccentricity.cpp
+++ b/example/eccentricity.cpp
@@ -7,7 +7,7 @@
 
 //[eccentricity_example
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -78,7 +78,7 @@ main(int argc, char *argv[])
     // Print the closeness centrality of each vertex.
     graph_traits<Graph>::vertex_iterator i, end;
     for(boost::tie(i, end) = vertices(g); i != end; ++i) {
-        cout << setw(12) << setiosflags(ios::left)
+        cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left)
                 << g[*i].name << get(em, *i) << endl;
     }
     cout << "radius: " << r << endl;
diff --git a/example/inclusive_mean_geodesic.cpp b/example/inclusive_mean_geodesic.cpp
index 91d5a0d4..d9c9f279 100644
--- a/example/inclusive_mean_geodesic.cpp
+++ b/example/inclusive_mean_geodesic.cpp
@@ -6,7 +6,7 @@
 
 //[inclusive_mean_geodesic_example
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/directed_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -117,15 +117,15 @@ main(int argc, char *argv[])
 
     // Print the mean geodesic distance of each vertex and finally,
     // the graph itself.
-    cout << setw(12) << setiosflags(ios::left) << "vertex";
-    cout << setw(12) << setiosflags(ios::left) << "excluding";
-    cout << setw(12) << setiosflags(ios::left) << "including" << endl;
+    cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left) << "vertex";
+    cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left) << "excluding";
+    cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left) << "including" << endl;
     graph_traits<Graph>::vertex_iterator i, end;
     for(tie(i, end) = vertices(g); i != end; ++i) {
-        cout << setw(12) << setiosflags(ios::left)
+        cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left)
              << g[*i].name
-             << setw(12) << get(exmap, *i)
-             << setw(12) << get(inmap, *i) << endl;
+             << boost::detail::setw(12) << get(exmap, *i)
+             << boost::detail::setw(12) << get(inmap, *i) << endl;
     }
     cout << "small world (excluding self-loops): " << ex << endl;
     cout << "small world (including self-loops): " << in << endl;
diff --git a/example/influence_prestige.cpp b/example/influence_prestige.cpp
index 348b0d16..6fc860d4 100644
--- a/example/influence_prestige.cpp
+++ b/example/influence_prestige.cpp
@@ -6,7 +6,7 @@
 
 //[influence_prestige_example
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/directed_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -64,7 +64,8 @@ main(int argc, char *argv[])
     graph_traits<Graph>::vertex_iterator i, end;
     for(tie(i, end) = vertices(g); i != end; ++i) {
         Vertex v = *i;
-        cout << setiosflags(ios::left) << setw(12)
+        cout << ::boost::detail::setiosflags(ios::left)
+             << ::boost::detail::setw(12)
              << g[v].name << "\t"
              << im[v] << "\t"
              << pm[v] << endl;
diff --git a/example/johnson-eg.cpp b/example/johnson-eg.cpp
index 557b1733..8ed3af0c 100644
--- a/example/johnson-eg.cpp
+++ b/example/johnson-eg.cpp
@@ -9,7 +9,7 @@
 #include <fstream>
 #include <iostream>
 #include <vector>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 #include <boost/property_map/property_map.hpp>
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/graphviz.hpp>
@@ -52,15 +52,15 @@ main()
 
   std::cout << "       ";
   for (int k = 0; k < V; ++k)
-    std::cout << std::setw(5) << k;
+    std::cout << boost::detail::setw(5) << k;
   std::cout << std::endl;
   for (int i = 0; i < V; ++i) {
-    std::cout << std::setw(3) << i << " -> ";
+    std::cout << boost::detail::setw(3) << i << " -> ";
     for (int j = 0; j < V; ++j) {
       if (D[i][j] == (std::numeric_limits<int>::max)())
-        std::cout << std::setw(5) << "inf";
+        std::cout << boost::detail::setw(5) << "inf";
       else
-        std::cout << std::setw(5) << D[i][j];
+        std::cout << boost::detail::setw(5) << D[i][j];
     }
     std::cout << std::endl;
   }
diff --git a/example/mean_geodesic.cpp b/example/mean_geodesic.cpp
index f6b6892c..b256464d 100644
--- a/example/mean_geodesic.cpp
+++ b/example/mean_geodesic.cpp
@@ -6,7 +6,7 @@
 
 //[mean_geodesic_example
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -78,7 +78,7 @@ main(int argc, char *argv[])
     // the graph itself.
     graph_traits<Graph>::vertex_iterator i, end;
     for(tie(i, end) = vertices(g); i != end; ++i) {
-        cout << setw(12) << setiosflags(ios::left)
+        cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left)
              << g[*i].name << get(gm, *i) << endl;
     }
     cout << "small world distance: " << sw << endl;
diff --git a/example/scaled_closeness_centrality.cpp b/example/scaled_closeness_centrality.cpp
index 5223da97..7cf1e929 100644
--- a/example/scaled_closeness_centrality.cpp
+++ b/example/scaled_closeness_centrality.cpp
@@ -6,7 +6,7 @@
 
 //[scaled_closeness_centrality_example
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/exterior_property.hpp>
@@ -105,7 +105,7 @@ main(int argc, char *argv[])
     // Print the scaled closeness centrality of each vertex.
     graph_traits<Graph>::vertex_iterator i, end;
     for(tie(i, end) = vertices(g); i != end; ++i) {
-        cout << setw(12) << setiosflags(ios::left)
+        cout << boost::detail::setw(12) << boost::detail::setiosflags(ios::left)
              << g[*i].name << get(cm, *i) << endl;
     }
 
diff --git a/test/bellman-test.cpp b/test/bellman-test.cpp
index 53bba704..fa10f867 100644
--- a/test/bellman-test.cpp
+++ b/test/bellman-test.cpp
@@ -14,7 +14,7 @@ B: 2147483647 B
 */
 
 #include <iostream>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/bellman_ford_shortest_paths.hpp>
 #include <boost/cstdlib.hpp>
@@ -66,9 +66,9 @@ int test_main(int, char*[])
     for(int i = 0; i < numVertex; ++i) {
       std::cout << name[i] << ": ";
       if (distance[i] == inf)
-        std::cout  << std::setw(3) << "inf";
+        std::cout  << boost::detail::setw(3) << "inf";
       else
-        std::cout << std::setw(3) << distance[i];
+        std::cout << boost::detail::setw(3) << distance[i];
       std::cout << " " << name[parent[i]] << std::endl;
     }
   } else {
@@ -87,9 +87,9 @@ int test_main(int, char*[])
     for(int i = 0; i < numVertex; ++i) {
       std::cout << name[i] << ": ";
       if (distance2[i] == inf)
-        std::cout  << std::setw(3) << "inf";
+        std::cout  << boost::detail::setw(3) << "inf";
       else
-        std::cout << std::setw(3) << distance2[i];
+        std::cout << boost::detail::setw(3) << distance2[i];
       std::cout << " " << name[parent2[i]] << std::endl;
     }
   } else {
diff --git a/test/johnson-test.cpp b/test/johnson-test.cpp
index f07eccea..0c6ab979 100644
--- a/test/johnson-test.cpp
+++ b/test/johnson-test.cpp
@@ -26,7 +26,7 @@
 #include <fstream>
 #include <iostream>
 #include <vector>
-#include <iomanip>
+#include <boost/detail/iomanip.hpp>
 #include <boost/property_map/property_map.hpp>
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/graphviz.hpp>
@@ -63,14 +63,14 @@ int main()
     int D[V][V];
     johnson_all_pairs_shortest_paths(g, D, distance_map(&d[0]));
 
-    std::cout << std::setw(5) <<" ";
+    std::cout << boost::detail::setw(5) <<" ";
     for (int k = 0; k < 10; ++k)
-      std::cout << std::setw(5) << k ;
+      std::cout << boost::detail::setw(5) << k ;
     std::cout << std::endl;
     for (int i = 0; i < 10; ++i) {
-      std::cout <<std::setw(5) <<  i ;
+      std::cout <<boost::detail::setw(5) <<  i ;
       for (int j = 0; j < 10; ++j) {
-          std::cout << std::setw(5) << D[i][j] ;
+          std::cout << boost::detail::setw(5) << D[i][j] ;
       }
       std::cout << std::endl;
     }