int main(int argc, char * argv[]) { srand_file(); Parameters p; if(set_parameters(argc, argv, p)==false) { if (argc>1) cerr<<"Please, look at ReadMe.txt..."<<endl; return -1; } erase_file_if_exists("network.dat"); erase_file_if_exists("community.dat"); erase_file_if_exists("statistics.dat"); benchmark(p.excess, p.defect, p.num_nodes, p.average_k, p.max_degree, p.tau, p.tau2, p.mixing_parameter, p.overlapping_nodes, p.overlap_membership, p.nmin, p.nmax, p.fixed_range); return 0; }
int main(int argc, char * argv[]) { srand_file(); Parameters p; if(set_parameters(argc, argv, p)==false) { if (argc>1) cerr<<"Please, look at ReadMe.txt..."<<endl; return -1; } erase_file_if_exists("network.dat"); erase_file_if_exists("community.dat"); erase_file_if_exists("statistics.dat"); int sy0= system("rm network_*"); sy0= system("rm community_*"); sy0= system("rm network_layer_*"); int num_of_original_graphs=p.num_of_original_graphs; int num_of_layers=p.num_of_layers; int layer_index=0; cout<<"No. of original graphs: "<<num_of_original_graphs<<" No. of layers per graph: "<<num_of_layers<<endl; int max_assignment=0; ofstream comout("level_node_cluster.clu"); ofstream multiplexout("level_node_node_weight.edges"); multiplexout<<"*Intra"<<endl; for(int ori=0; ori<num_of_original_graphs; ori++) { // generating and printing graph benchmark(p.excess, p.defect, p.num_nodes, p.average_k, p.max_degree, p.tau, p.tau2, \ p.mixing_parameter, p.overlapping_nodes, p.overlap_membership, \ p.nmin, p.nmax, p.fixed_range, p.clustering_coeff); char buffer[1000]; sprintf(buffer, "mv network.dat network_%d", ori); int sy=system(buffer); sprintf(buffer, "mv community.dat community_%d", ori); sy=system(buffer); system("rm statistics.dat"); // creating layers max_assignment= create_layers(layer_index, num_of_layers, ori, comout, max_assignment, multiplexout); } comout.close(); multiplexout.close(); return 0; }
/** * @brief main * @param argc * @param argv * @return */ int main(int argc, char * argv[]) { try { FILELog::ReportingLevel() = logDEBUG; srand_file(); Parameters p; if(set_parameters(argc, argv, p)==false) { if (argc>1) cerr << "Please, look at README.txt..." << endl; return -1; } erase_file_if_exists("network.dat"); erase_file_if_exists("matrix.dat"); erase_file_if_exists("community.dat"); erase_file_if_exists("statistics.dat"); Eigen::MatrixXd W; // weighted adjacency matrix vector<int> m(p.num_nodes); benchmark(p.excess, p.defect, p.num_nodes, p.average_k, p.max_degree, p.tau_degree, p.tau_commsize, p.mixing_parameter_topological, p.mixing_parameter_weights, p.beta, p.overlapping_nodes, p.overlap_membership, p.nmin, p.nmax, p.fixed_range, p.clustering_coeff, W,m); ofstream os; os.open("matrix.dat"); os << W.block(0,0,10,10) << endl; } catch (const std::exception &e) { cout << e.what() << endl; } /* ofstream osmemb; osmemb.open("community.dat"); for (size_t i=0; i<m.size();++i) osmemb << m.at(i) << endl; */ return 0; }