igraph / rigraph

igraph R package
https://r.igraph.org
551 stars 200 forks source link

inconsistent behaviour of get.adjacency.dense and get.adjacency.sparse for weighted multigraphs #1551

Open schochastics opened 2 weeks ago

schochastics commented 2 weeks ago

What happens, and what did you expect instead?

The internal functions get.adjacency.dense() and get.adjacency.sparse() return different results for weighted multigraphs. get.adjacency.sparse() aggregates weights for multi edges and get.adjacency.dense() reports the weight of the last edge. In my opinion, the behavior of get.adjacency.sparse() is correct. The PR #1518 coincidentally fixes this.

Given this is indeed a bug, then the following test should be fixed either in a new PR or the existing PR #1518 (see also the discussion there)

https://github.com/igraph/rigraph/blob/0d96334876472a8e311efc50297cd5de83dee975/tests/testthat/test-conversion.R#L175-L183

To reproduce

igraph 2.0.3

library(igraph)
#> 
#> Attaching package: 'igraph'
#> The following objects are masked from 'package:stats':
#> 
#>     decompose, spectrum
#> The following object is masked from 'package:base':
#> 
#>     union
g <- make_graph(c(1,2, 2,1, 2,2, 3,3, 3,3, 3,4, 4,2, 4,2, 4,2), directed = TRUE)
E(g)$weight <- c(1.2, 3.4, 2.7, 5.6, 6.0, 0.1, 6.1, 3.3, 4.3)
as_adjacency_matrix(g, attr = "weight", sparse = FALSE)
#>      [,1] [,2] [,3] [,4]
#> [1,]  0.0  1.2    0  0.0
#> [2,]  3.4  2.7    0  0.0
#> [3,]  0.0  0.0    6  0.1
#> [4,]  0.0  4.3    0  0.0
as_adjacency_matrix(g, attr = "weight", sparse = TRUE)
#> 4 x 4 sparse Matrix of class "dgCMatrix"
#>                       
#> [1,] .    1.2  .   .  
#> [2,] 3.4  2.7  .   .  
#> [3,] .    .   11.6 0.1
#> [4,] .   13.7  .   .

Created on 2024-10-10 with reprex v2.1.1

System information

No response

szhorvat commented 2 weeks ago

Yes, the weights should be added up. Thanks for catching this!

IMO the best solution here is to call the C core, which is not happening now. Relying on the C core ensures consistency and reduces code duplication.

The C core does not support Boolean adjacency matrices, so it is to be decided what to do with that. Options are to implement this in R, or to convert logical values to numeric, then convert back again. It's also a question whether logicals should be supported. One argument in favour is that it's not too difficult to do so.

schochastics commented 2 weeks ago

So what's your take on PR #1518? Does it make sense to merge optimised R code or should this be replaced entirely by calls to the C core (when possible)?

maelle commented 1 week ago

@szhorvat friendly reminder about @schochastics' question above. Is the conversion of sparse matrices from C to R and vice versa still a blocker for this?

maelle commented 1 week ago

related (I think?) https://github.com/igraph/rigraph/issues/1137