import new upstream nautilus stable release 14.2.8

[ceph.git] / ceph / src / boost / libs / graph / example / csr-example.cpp

diff --git a/ceph/src/boost/libs/graph/example/csr-example.cpp b/ceph/src/boost/libs/graph/example/csr-example.cpp
index b597193a1def90c17a159589e6ee65f91fa383b3..942eb395769c859832b74d175afa9b85fba33621 100644 (file)
--- a/ceph/src/boost/libs/graph/example/csr-example.cpp
+++ b/ceph/src/boost/libs/graph/example/csr-example.cpp
@@ -6,6 +6,7 @@
 
 //  Authors: Douglas Gregor
 //           Andrew Lumsdaine
+
 #include <boost/graph/compressed_sparse_row_graph.hpp>
 #include <string>
 #include <boost/graph/iteration_macros.hpp>
@@ -33,13 +34,13 @@ int main()
     "http://www.boost.org/libs/graph/doc/using_adjacency_list.html",
   };
 
-  E the_edges[] = { E(0, 1), E(0, 2), E(0, 3), E(1, 0), E(1, 3), E(1, 5), 
-                    E(2, 0), E(2, 5), E(3, 1), E(3, 4), E(4, 1), E(5, 0), 
+  E the_edges[] = { E(0, 1), E(0, 2), E(0, 3), E(1, 0), E(1, 3), E(1, 5),
+                    E(2, 0), E(2, 5), E(3, 1), E(3, 4), E(4, 1), E(5, 0),
                     E(5, 2) };
 
   typedef compressed_sparse_row_graph<directedS, WebPage> WebGraph;
   WebGraph g(boost::edges_are_sorted, &the_edges[0], &the_edges[0] + sizeof(the_edges)/sizeof(E), 6);
-  
+
   // Set the URLs of each vertex
   int index = 0;
   BGL_FORALL_VERTICES(v, g, WebGraph)
@@ -48,13 +49,13 @@ int main()
   // Output each of the links
   std::cout << "The web graph:" << std::endl;
   BGL_FORALL_EDGES(e, g, WebGraph)
-    std::cout << "  " << g[source(e, g)].url << " -> " << g[target(e, g)].url 
+    std::cout << "  " << g[source(e, g)].url << " -> " << g[target(e, g)].url
               << std::endl;
-    
+
   // Output the graph in DOT format
   dynamic_properties dp;
   dp.property("label", get(&WebPage::url, g));
   std::ofstream out("web-graph.dot");
-  write_graphviz(out, g, dp, std::string(), get(vertex_index, g));
+  write_graphviz_dp(out, g, dp, std::string(), get(vertex_index, g));
   return 0;
 }