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
13
main()14 int main() {
15
16 typedef adjacency_list<setS, vecS, bidirectionalS> graph_type;
17
18 // Build graph1
19 int num_vertices1 = 8; graph_type graph1(num_vertices1);
20 add_edge(0, 6, graph1); add_edge(0, 7, graph1);
21 add_edge(1, 5, graph1); add_edge(1, 7, graph1);
22 add_edge(2, 4, graph1); add_edge(2, 5, graph1); add_edge(2, 6, graph1);
23 add_edge(3, 4, graph1);
24
25 // Build graph2
26 int num_vertices2 = 9; graph_type graph2(num_vertices2);
27 add_edge(0, 6, graph2); add_edge(0, 8, graph2);
28 add_edge(1, 5, graph2); add_edge(1, 7, graph2);
29 add_edge(2, 4, graph2); add_edge(2, 7, graph2); add_edge(2, 8, graph2);
30 add_edge(3, 4, graph2); add_edge(3, 5, graph2); add_edge(3, 6, graph2);
31
32 // Create callback to print mappings
33 vf2_print_callback<graph_type, graph_type> callback(graph1, graph2);
34
35 // Print out all subgraph isomorphism mappings between graph1 and graph2.
36 // Vertices and edges are assumed to be always equivalent.
37 vf2_subgraph_iso(graph1, graph2, callback);
38
39 return 0;
40 }
41