#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/vf2_sub_graph_iso.hpp>

int main() {
  using namespace boost;

  typedef adjacency_list<vecS, vecS, bidirectionalS> graph_type;
  
  // Build graph1:
  //
  //      (0) ---> (1)
  //
  graph_type graph1(2);
  add_edge(0, 1, graph1); 
  
  // Build graph2:
  //
  //                +--------+
  //                V        |
  //      (0) ---> (1) ---> (2)
  //
  graph_type graph2(3);
  add_edge(0, 1, graph2); 
  add_edge(1, 2, graph2); 
  add_edge(2, 1, graph2);

  std::cout << "Expected result (in random order):\n"
            << "(0, 0) (1, 1)\n"
            << "(0, 1) (, 2)\n"
            << "(0, 2) (1, 1)\n"
            << "\n";
  std::cout << "Actual result:\n";
 
  vf2_print_callback<graph_type, graph_type> callback(graph1, graph2);
  vf2_subgraph_iso(graph1, graph2, callback);

  return 0;
}