1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
|
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/vf2_sub_graph_iso.hpp>
using namespace std;
using namespace boost;
struct my_callback
{
template <typename CorrespondenceMap1To2, typename CorrespondenceMap2To1>
bool operator()(CorrespondenceMap1To2 f, CorrespondenceMap2To1 g) const
{
return false;
}
};
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.
cout<<vf2_subgraph_iso(graph1, graph2,my_callback())<<endl;
return 0;
} |
Partager