模拟退火实验报告.docxVIP

算法报告一、课题名称一种用于生物网络中最多公共边子图检测的模拟退火算法二、实验目的介绍了一种用于多重最多公共边子图问题的启发式算法，它能够有效地检测出在多个真实世界大小的网络上共享的大型公共子结构。三、实验环境现代C ++编译器支持C ++ 11和OpenMPmakeCMake = 2.8Boost标题help2man（可选，用于手册页生成）四、实验主要步骤安装所有以上环境后，运行以下命令：git clone --recursive /SimonLarsen/sailmcs.gitcd sailmcscmake . make或者，您可以安装二进制文件和文档：sudo make install要对齐三个图表，运行600秒：sailmcs -t 600 -g mcs.gw -o alignment.txt graph1.gw graph2.gw graph3.gw最大公共子图将被写入文件mcs.gw，顶点对齐表将被写入alignment.txt。五、实验核心代码#include sailmcs/ls/Best.hpp#include algorithm#include random#include sailmcs/ls/Common.hppnamespace ublas = boost::numeric::ublas;namespace sailmcs {namespace ls {void Best::localSearch(const std::vectorGraph graphs,Solution solution) {size_t m = solution.alignment.size1();size_t n = solution.alignment.size2();// Create reverse alignment mappingstd::vectorstd::vectorsize_t map;create_map(graphs, solution, map);// Count number of graphs each edge is covered inedge_count_matrix edges;count_edges(graphs, map, solution, edges);// Build neighbor listsstd::vectorneighbor_list neighbors;create_neighbor_lists(graphs, map, solution, neighbors);// Active index mapstd::vectorint active(m, 0);std::random_device rd;std::minstd_rand rand_gen(rd());int iteration = 0;bool repeat;do {repeat = false;for(size_t g = 0; g n-1; ++g) {int best_delta = 0;size_t best_i = 0;size_t best_j = 0;#pragma omp parallel{int prv_best_delta = 0;size_t prv_best_i = 0;size_t prv_best_j = 0;#pragma omp for schedule(static, 1)for(size_t i = 0; i m; ++i) {for(size_t j = i+1; j m; ++j) {if(active[i] iteration active[j] iteration) continue;int delta = get_delta(i, j, g, neighbors, edges);if(delta 0) {active[i] = iteration+1;active[j] = iteration+1;}if(delta prv_best_delta) {prv_best_delta = delta;prv_best_i = i;prv_best_j = j;}}}#pragma omp critical{if(prv_best_delta best_delta) {best_delta = prv_best_delta;best_i = prv_best_i;best_j = prv_best_j;}}}if(best_delta 0) {repeat = true;swap(best_i, best_j, g, iteration, neighbors, edges, solution, active);}}iteration++;} whi