update

Author: CarloLucibello

src/gnngraph.jl

@@ -263,7 +263,11 @@ function adjacency_list(g::GNNGraph; dir=:out)
 end
 
 function LightGraphs.adjacency_matrix(g::GNNGraph{<:COO_T}, T::DataType=Int; dir=:out)
-    A, n, m = to_sparse(g.graph, T, num_nodes=g.num_nodes)
+    if g.graph[1] isa CuVector
+        A, n, m = to_dense(g.graph, T, num_nodes=g.num_nodes)
+    else
+        A, n, m = to_sparse(g.graph, T, num_nodes=g.num_nodes)
+    end
     @assert size(A) == (n, n)
     return dir == :out ? A : A'
 end

src/graph_conversions.jl

@@ -124,7 +124,6 @@ end
 
 function to_sparse(coo::COO_T, T::DataType=Int; dir=:out, num_nodes=nothing)
     s, t, eweight  = coo
-    s isa CuVector && return to_dense(coo, T; dir, num_nodes)
     eweight = isnothing(eweight) ? fill!(similar(s, T), 1) : eweight
     num_nodes = isnothing(num_nodes) ? max(maximum(s), maximum(t)) : num_nodes 
     A = sparse(s, t, eweight, num_nodes, num_nodes)