update source to Ceph Pacific 16.2.2

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

diff --git a/ceph/src/boost/libs/graph/example/successive_shortest_path_nonnegative_weights_example.cpp b/ceph/src/boost/libs/graph/example/successive_shortest_path_nonnegative_weights_example.cpp
index 0edc3710f4833b931fde14a73c4caf2e842e4f07..017972038a24c73b5fd8e48c35b387d6a7aed118 100644 (file)
--- a/ceph/src/boost/libs/graph/example/successive_shortest_path_nonnegative_weights_example.cpp
+++ b/ceph/src/boost/libs/graph/example/successive_shortest_path_nonnegative_weights_example.cpp
@@ -1,6 +1,6 @@
 //=======================================================================
 // Copyright 2013 University of Warsaw.
-// Authors: Piotr Wygocki 
+// Authors: Piotr Wygocki
 //
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
@@ -12,19 +12,16 @@
 
 #include "../test/min_cost_max_flow_utils.hpp"
 
-
-int main() {
-    boost::SampleGraph::vertex_descriptor s,t;
-    boost::SampleGraph::Graph g; 
+int main()
+{
+    boost::SampleGraph::vertex_descriptor s, t;
+    boost::SampleGraph::Graph g;
     boost::SampleGraph::getSampleGraph(g, s, t);
 
     boost::successive_shortest_path_nonnegative_weights(g, s, t);
 
-    int cost =  boost::find_flow_cost(g);
+    int cost = boost::find_flow_cost(g);
     assert(cost == 29);
 
     return 0;
 }
-
-
-