12345678910111213141516171819202122232425262728293031323334353637383940 |
- //=======================================================================
- // Copyright (C) 2012 Flavio De Lorenzi (fdlorenzi@gmail.com)
- //
- // Distributed under the Boost Software License, Version 1.0. (See
- // accompanying file LICENSE_1_0.txt or copy at
- // http://www.boost.org/LICENSE_1_0.txt)
- //=======================================================================
- #include <boost/graph/adjacency_list.hpp>
- #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;
- }
|