//*********************GRAPHS**********************************
//graph_1,graph_2 are graph adjacency matrices, 
//C_matrix is the matrix of local similarities  between vertices of graph_1 and graph_2. 
//If graph_1 is NxN and graph_2 is MxM then C_matrix should be NxM
graph_1=fly_inp_so_sel.adj s
graph_2=yeast_inp_so_sel.adj s
C_matrix=c_inp_so_sel.sim s
//*******************ALGORITHMS********************************
//used algorithms and what should be used as initial solution in corresponding algorithms
algo=PATH s
algo_init_sol=unif s
solution_file=solution_im.txt s
//coeficient of linear combination between (1-alpha_ldh)*||graph_1-P*graph_2*P^T||^2_F +alpha_ldh*C_matrix 
alpha_ldh=0 d
cdesc_matrix=A c
cscore_matrix=A c
//**************PARAMETERS SECTION*****************************
hungarian_max=10000 d
algo_fw_xeps=0.01 d
algo_fw_feps=0.01 d
//0 - just add a set of isolated nodes to the smallest graph, 1 - double size 
dummy_nodes=1 i
// fill for dummy nodes (0.5 - these nodes will be connected with all other by edges of weight 0.5(min_weight+max_weight))
dummy_nodes_fill=0 d
// fill for linear matrix C, usually that's the minimum (dummy_nodes_c_coef=0),
// but may be the maximum (dummy_nodes_c_coef=1)
dummy_nodes_c_coef=1 d

qcvqcc_lambda_M=10 d
qcvqcc_lambda_min=1e-5 d


//0 - all matching are possible, 1-only matching with positive local similarity are possible
blast_match=1 i
blast_match_proj=1 i
//different options to control the best path solution
best_path_proj_sol=0 i
best_path_blast_proj_sol=1 i
best_path_greedy_sol=0 i
best_path_blast_greedy_sol=1 i


//****************OUTPUT***************************************
//output file and its format 
exp_out_file=graphm_0_01_1_path.txt s
exp_out_format=Parameters Compact Permutation s
//other
debugprint=0 i
debugprint_file=debug.txt s
verbose_mode=1 i
//verbose file may be a file or just a screen:cout
verbose_file=cout s