1 //=======================================================================
2 // Copyright (C) 2012 Flavio De Lorenzi (fdlorenzi@gmail.com)
3 //
4 // Distributed under the Boost Software License, Version 1.0. (See
5 // accompanying file LICENSE_1_0.txt or copy at
6 // http://www.boost.org/LICENSE_1_0.txt)
7 //=======================================================================
8
9 #include <boost/graph/adjacency_list.hpp>
10 #include <boost/graph/vf2_sub_graph_iso.hpp>
11 using namespace boost;
12
main()13 int main()
14 {
15
16 typedef adjacency_list< setS, vecS, bidirectionalS > graph_type;
17
18 // Build graph1
19 int num_vertices1 = 8;
20 graph_type graph1(num_vertices1);
21 add_edge(0, 6, graph1);
22 add_edge(0, 7, graph1);
23 add_edge(1, 5, graph1);
24 add_edge(1, 7, graph1);
25 add_edge(2, 4, graph1);
26 add_edge(2, 5, graph1);
27 add_edge(2, 6, graph1);
28 add_edge(3, 4, graph1);
29
30 // Build graph2
31 int num_vertices2 = 9;
32 graph_type graph2(num_vertices2);
33 add_edge(0, 6, graph2);
34 add_edge(0, 8, graph2);
35 add_edge(1, 5, graph2);
36 add_edge(1, 7, graph2);
37 add_edge(2, 4, graph2);
38 add_edge(2, 7, graph2);
39 add_edge(2, 8, graph2);
40 add_edge(3, 4, graph2);
41 add_edge(3, 5, graph2);
42 add_edge(3, 6, graph2);
43
44 // Create callback to print mappings
45 vf2_print_callback< graph_type, graph_type > callback(graph1, graph2);
46
47 // Print out all subgraph isomorphism mappings between graph1 and graph2.
48 // Vertices and edges are assumed to be always equivalent.
49 vf2_subgraph_iso(graph1, graph2, callback);
50
51 return 0;
52 }
53