Running examples in ‘RGraphM-Ex.R’ failed
The error most likely occurred in:

> ### Name: run_graph_match
> ### Title: Matches two graphs with adjacency matrices
> ### Aliases: run_graph_match
> 
> ### ** Examples
> 
> B<-matrix( sample(c(0,1),225, replace = TRUE,prob=c(0.75,0.25)),15,15)
> diag(B)<- 1
> perm <- sample.int(15)
> B<-(B+t(B))/2
> B[B>0.1] <- 1
> A<-B [perm,][,perm]
> 
> # parameters copied from test_simple example or graphm
> algorithm_params<-list(
+ # Already provided as A and B matrices
+ # *******************ALGORITHMS********************************
+ # used algorithms and what should be used as
+ #initial solution in corresponding algorithms
+ algo="I QCV PATH",
+ algo_init_sol="unif unif unif",
+ solution_file="solution_im.txt",
+ # coeficient of linear combination between
+ # (1-alpha_ldh)*||graph_1-P*graph_2*P^T||^2_F +alpha_ldh*C_matrix
+ alpha_ldh=0 ,
+ cdesc_matrix="A" ,
+ cscore_matrix="A" ,
+ C_matrix = "none",
+ # **************PARAMETERS SECTION*****************************
+ hungarian_max=10000 ,
+ algo_fw_xeps=0.01 ,
+ algo_fw_feps=0.01 ,
+ # 0 - just add a set of isolated nodes to the smallest graph
+ # 1 - double size
+ dummy_nodes=0,
+ # 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,
+ # 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=0.01,
+ 
+ qcvqcc_lambda_M=10,
+ qcvqcc_lambda_min=1E-5,
+ 
+ 
+ # 0 - all matching are possible, 1-only matching with positive local similarity are possible
+ blast_match=1 ,
+ blast_match_proj=0 ,
+ 
+ 
+ #****************OUTPUT***************************************
+ #output file and its format
+ exp_out_file="exp_out_file" ,
+ exp_out_format="Parameters Compact Permutation",
+ #other
+ debugprint=1 ,
+ debugprint_file="debug.txt",
+ verbose_mode=1 ,
+ # verbose file may be a file or just a screen:cout
+ verbose_file="verbose_debug.txt",
+ graph_dot_print = 1
+ )
> print( algorithm_params)
$algo
[1] "I QCV PATH"

$algo_init_sol
[1] "unif unif unif"

$solution_file
[1] "solution_im.txt"

$alpha_ldh
[1] 0

$cdesc_matrix
[1] "A"

$cscore_matrix
[1] "A"

$C_matrix
[1] "none"

$hungarian_max
[1] 10000

$algo_fw_xeps
[1] 0.01

$algo_fw_feps
[1] 0.01

$dummy_nodes
[1] 0

$dummy_nodes_fill
[1] 0

$dummy_nodes_c_coef
[1] 0.01

$qcvqcc_lambda_M
[1] 10

$qcvqcc_lambda_min
[1] 1e-05

$blast_match
[1] 1

$blast_match_proj
[1] 0

$exp_out_file
[1] "exp_out_file"

$exp_out_format
[1] "Parameters Compact Permutation"

$debugprint
[1] 1

$debugprint_file
[1] "debug.txt"

$verbose_mode
[1] 1

$verbose_file
[1] "verbose_debug.txt"

$graph_dot_print
[1] 1

> print ("Dimensions of A")
[1] "Dimensions of A"
> print (dim(A))
[1] 15 15
> print ("Dimensions of B")
[1] "Dimensions of B"
> print (dim(B))
[1] 15 15
>  result <- run_graph_match(A, B, algorithm_params)
Running Graph matching algorithms with following algorithms
I
QCV
PATH
gsl: ../../src/gsl-1.16/matrix/init_source.c:29: ERROR: matrix dimension n1 must be positive integer
Default GSL error handler invoked.