Skip to content

Commit 258d35e

Browse files
committed
Fix imports
1 parent 992e5bc commit 258d35e

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

GNNlib/ext/GNNlibCUDAExt.jl

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ module GNNlibCUDAExt
33
using CUDA
44
using Random, Statistics, LinearAlgebra
55
using GNNlib: GNNlib, propagate, copy_xj, e_mul_xj, w_mul_xj
6-
using GNNGraphs: GNNGraph, COO_T, SPARSE_T
6+
using GNNGraphs: GNNGraph, COO_T, SPARSE_T, to_dense, to_sparse
77

88
const CUDA_COO_T = Tuple{T, T, V} where {T <: AnyCuArray{<:Integer}, V <: Union{Nothing, AnyCuArray}}
99

@@ -55,9 +55,9 @@ function _adjacency_matrix(g::GNNGraph{<:CUDA_COO_T}, T::DataType = eltype(g); d
5555
if !g.is_coalesced
5656
# Revisit after
5757
# https://github.com/JuliaGPU/CUDA.jl/issues/1113
58-
A, n, m = GNNGraphs.to_dense(g.graph, T; num_nodes = g.num_nodes, weighted) # if not coalesced, construction of sparse matrix is slow
58+
A, n, m = to_dense(g.graph, T; num_nodes = g.num_nodes, weighted) # if not coalesced, construction of sparse matrix is slow
5959
else
60-
A, n, m = GNNGraphs.to_sparse(g.graph, T; num_nodes = g.num_nodes, weighted, is_coalesced = true)
60+
A, n, m = to_sparse(g.graph, T; num_nodes = g.num_nodes, weighted, is_coalesced = true)
6161
end
6262
@assert size(A) == (n, n)
6363
return dir == :out ? A : A'

0 commit comments

Comments
 (0)