update source to Ceph Pacific 16.2.2

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

diff --git a/ceph/src/boost/libs/graph/example/vf2_sub_graph_iso_example.cpp b/ceph/src/boost/libs/graph/example/vf2_sub_graph_iso_example.cpp
index 8e17d2a70cffd6e8cd1329c7091506836f83f30a..613cb69670e3fc6ef1bd2b4bb5edc566413bc928 100644 (file)
--- a/ceph/src/boost/libs/graph/example/vf2_sub_graph_iso_example.cpp
+++ b/ceph/src/boost/libs/graph/example/vf2_sub_graph_iso_example.cpp
@@ -10,31 +10,43 @@
 #include <boost/graph/vf2_sub_graph_iso.hpp>
 using namespace boost;
 
-
-int main() {
-
-  typedef adjacency_list<setS, vecS, bidirectionalS> graph_type;
-  
-  // Build graph1
-  int num_vertices1 = 8; graph_type graph1(num_vertices1);
-  add_edge(0, 6, graph1); add_edge(0, 7, graph1);
-  add_edge(1, 5, graph1); add_edge(1, 7, graph1);
-  add_edge(2, 4, graph1); add_edge(2, 5, graph1); add_edge(2, 6, graph1);
-  add_edge(3, 4, graph1);
-
-  // Build graph2
-  int num_vertices2 = 9; graph_type graph2(num_vertices2);
-  add_edge(0, 6, graph2); add_edge(0, 8, graph2);
-  add_edge(1, 5, graph2); add_edge(1, 7, graph2);
-  add_edge(2, 4, graph2); add_edge(2, 7, graph2); add_edge(2, 8, graph2);
-  add_edge(3, 4, graph2); add_edge(3, 5, graph2); add_edge(3, 6, graph2);
-
-  // Create callback to print mappings
-  vf2_print_callback<graph_type, graph_type> callback(graph1, graph2);
-
-  // Print out all subgraph isomorphism mappings between graph1 and graph2.
-  // Vertices and edges are assumed to be always equivalent.
-  vf2_subgraph_iso(graph1, graph2, callback);
-
-  return 0;
+int main()
+{
+
+    typedef adjacency_list< setS, vecS, bidirectionalS > graph_type;
+
+    // Build graph1
+    int num_vertices1 = 8;
+    graph_type graph1(num_vertices1);
+    add_edge(0, 6, graph1);
+    add_edge(0, 7, graph1);
+    add_edge(1, 5, graph1);
+    add_edge(1, 7, graph1);
+    add_edge(2, 4, graph1);
+    add_edge(2, 5, graph1);
+    add_edge(2, 6, graph1);
+    add_edge(3, 4, graph1);
+
+    // Build graph2
+    int num_vertices2 = 9;
+    graph_type graph2(num_vertices2);
+    add_edge(0, 6, graph2);
+    add_edge(0, 8, graph2);
+    add_edge(1, 5, graph2);
+    add_edge(1, 7, graph2);
+    add_edge(2, 4, graph2);
+    add_edge(2, 7, graph2);
+    add_edge(2, 8, graph2);
+    add_edge(3, 4, graph2);
+    add_edge(3, 5, graph2);
+    add_edge(3, 6, graph2);
+
+    // Create callback to print mappings
+    vf2_print_callback< graph_type, graph_type > callback(graph1, graph2);
+
+    // Print out all subgraph isomorphism mappings between graph1 and graph2.
+    // Vertices and edges are assumed to be always equivalent.
+    vf2_subgraph_iso(graph1, graph2, callback);
+
+    return 0;
 }