Ticket #12613: test_simple.cpp

#include <iostream>
#include <fstream>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <iterator>

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

using namespace boost;

int main()
{
    typedef property<edge_name_t, char> edge_prop;
    typedef property<vertex_name_t, char, property<vertex_index_t, int> > vertex_prop;

    //typedef adjacency_list<vecS, vecS, bidirectionalS, vertex_prop, edge_prop> Graph;
    typedef adjacency_list<vecS, vecS, undirectedS, vertex_prop, edge_prop> Graph;
    //typedef adjacency_list<setS, vecS, undirectedS, vertex_prop, edge_prop> Graph;

    typedef property_map<Graph, vertex_name_t>::type vertex_name_map_t;
    typedef property_map_equivalent<vertex_name_map_t, vertex_name_map_t> vertex_comp_t;

    typedef property_map<Graph, edge_name_t>::type edge_name_map_t;
    typedef property_map_equivalent<edge_name_map_t, edge_name_map_t> edge_comp_t;

    Graph graph1;

    add_vertex(vertex_prop('a'), graph1);
    add_edge(0, 0, edge_prop('a'), graph1);

    Graph graph2;

    add_vertex(vertex_prop('a'), graph2);
    add_edge(0, 0, edge_prop('a'), graph2);

    // vertex / edge predicates
    vertex_comp_t vertex_comp =
        make_property_map_equivalent(get(vertex_name, graph1), get(vertex_name, graph2));
    edge_comp_t edge_comp =
        make_property_map_equivalent(get(edge_name, graph1), get(edge_name, graph2));

    // compute subgraph iso
    std::cout << "Matched verices: " << std::endl;
    vf2_print_callback<Graph, Graph> callback(graph1, graph2);
    vf2_subgraph_iso(graph1, graph2, callback, vertex_order_by_mult(graph1),
        edges_equivalent(edge_comp).vertices_equivalent(vertex_comp));

    // out_edges 
    std::cout << "Out edges: " << std::endl;
    std::set<graph_traits<Graph>::edge_descriptor> edges;
    graph_traits<Graph>::out_edge_iterator e, e_end;
    for (tie(e, e_end) = out_edges(0, graph1); e != e_end; ++e) {
        std::cout << "(" << source(*e, graph1)
                  << "," << target(*e, graph1) << ")" <<  ", " << *e << std::endl;
        edges.insert(*e);
    }

    std::cout << std::endl;
    std::cout << "num different edge descriptors: " << edges.size() << std::endl;

    return 1;
}